{"id":"n-7f0d815631f41e18","revision":0,"first_index":0,"fingerprint":"f6-371721bfd00b48c7","name":"basis_map_A013610 of Number of compositions of n with k parts, T(n, k) = binomial(n-1, k-1) for n, k >= 1 and T(n, 0) = 0^n, triangle read by rows for n >= 0 and 0 <= k <= n.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["1","3"],["2","9","9"],["4","24","45","27"],["8","60","162","189","81"],["16","144","504","864","729","243"],["32","336","1440","3240","4050","2673","729"],["64","768","3888","10800","17820","17496","9477","2187"],["128","1728","10080","33264","68040","88452","71442","32805","6561"],["256","3840","25344","96768","235872","381024","408240","279936","111537","19683"],["512","8448","62208","269568","762048","1469664","1959552","1784592","1062882","373977","59049"],["1024","18432","149760","725760","2332800","5225472","8328096","9447840","7479540","3936600","1240029","177147"],["2048","39936","354816","1900800","6842880","17449344","32332608","43879968","43302600","30311820","14289858","4074381","531441"],["4096","86016","829440","4866048","19388160","55427328","117013248","184757760","218245104","190531440","119515176","51018336","13286025","1594323"],["8192","184320","1916928","12220416","53374464","169019136","400308480","720555264","990763488","1035798192","810624672","460582200","179627058","43046721","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","20","100","500","2500","12500","62500","312500","1562500","7812500","39062500","195312500","976562500","4882812500"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","3"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2","-3"],["2","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201360,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-bffd1afaf5f73bbb"]},{"id":201361,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-bffd1afaf5f73bbb"]},{"id":201362,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-bffd1afaf5f73bbb"]},{"id":201363,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-bffd1afaf5f73bbb"]}],"region_exact":{},"incoming_edges":[{"id":"e-bffd1afaf5f73bbb","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-7f0d815631f41e18","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"5d5f9d712c450208f07d6f0ee183f07d91bf8de770eeac5729cc049308c05382","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-3783f6df357ea675","role":"sequence","name":"Number of compositions of n with k parts, T(n, k) = binomial(n-1, k-1) for n, k >= 1 and T(n, 0) = 0^n, triangle read by rows for n >= 0 and 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-45944d8519c04438","kind":"fingerprint_related","node_a_id":"n-7f0d815631f41e18","node_b_id":"n-7636b3f71b24a7ca","fingerprint":"f6-371721bfd00b48c7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-371721bfd00b48c7"},"other_id":"n-7636b3f71b24a7ca","other":{"id":"n-7636b3f71b24a7ca","name":"basis_map_A013610 of Triangle read by rows: The convolution triangle of 2^n, where the convolution triangle of a sequence is defined in A357368.","first_index":0,"fingerprint":"f6-371721bfd00b48c7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2","6"],["8","36","36"]],"card_rows":[["1"],["2","6"],["8","36","36"],["32","192","360","216"]],"row_sums_preview":["1","8","80","800","8000","80000","800000","8000000"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-ff74e25052457f18","steps":["basis A013610"],"edges":["e-a053114a6dc06dba"],"text":"A380114 \u2192 basis A013610"},"headline":"A380114 \u2192 basis A013610","chain":null}},{"id":"l-d4f6ef5105438790","kind":"fingerprint_related","node_a_id":"n-7f0d815631f41e18","node_b_id":"n-bb688d94764393f4","fingerprint":"f6-371721bfd00b48c7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-371721bfd00b48c7"},"other_id":"n-bb688d94764393f4","other":{"id":"n-bb688d94764393f4","name":"basis_map_A013610 of Triangle read by rows, T(n,k) = (n+1)*binomial(n-1,k-1).","first_index":0,"fingerprint":"f6-371721bfd00b48c7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2","6"],["6","27","27"]],"card_rows":[["1"],["2","6"],["6","27","27"],["16","96","180","108"]],"row_sums_preview":["1","8","60","400","2500","15000","87500","500000"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-a88a7983f557eac4","steps":["basis A013610"],"edges":["e-a1f8d98dc7ebf455"],"text":"A127952 \u2192 basis A013610"},"headline":"A127952 \u2192 basis A013610","chain":null}}],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:   1;\n  1:   1,    3;\n  2:   2,    9,     9;\n  3:   4,   24,    45,    27;\n  4:   8,   60,   162,   189,     81;\n  5:  16,  144,   504,   864,    729,    243;\n  6:  32,  336,  1440,  3240,   4050,   2673,    729;\n  7:  64,  768,  3888, 10800,  17820,  17496,   9477,   2187;\n  8: 128, 1728, 10080, 33264,  68040,  88452,  71442,  32805,   6561;\n  9: 256, 3840, 25344, 96768, 235872, 381024, 408240, 279936, 111537, 19683;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 2 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 2 + (3*n - 3)*x)*v[i - 1])/(n - 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-3783f6df357ea675","steps":["basis A013610"],"edges":["e-bffd1afaf5f73bbb"],"text":"A097805 \u2192 basis A013610"},"headline":"A097805 \u2192 basis A013610","chain":null}