{"id":"n-3388161425ab794b","revision":0,"first_index":0,"fingerprint":"f6-c5fb4726d5143de7","name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["3","4"],["9","20"],["27","84","32"],["81","324","256"],["243","1188","1440","256"],["729","4212","6912","2816"],["2187","14580","30240","19968","2048"],["6561","49572","124416","115200","28672"],["19683","166212","489888","587520","245760","16384"],["59049","551124","1866240","2757888","1658880","278528"],["177147","1810836","6928416","12192768","9676800","2801664","131072"],["531441","5904900","25194240","51508224","51093504","21676032","2621440"],["1594323","19131876","90069408","209952000","250822656","142442496","30277632","1048576"],["4782969","61647156","317447424","831409920","1164533760","836075520","264241152","24117248"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","7","29","143","661","3127","14669","69023","324421","1525447","7171709","33718703","158529781","745338967","3504255149"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204738,"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-7ffda5c25cf9d962"]},{"id":204739,"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-7ffda5c25cf9d962"]},{"id":204740,"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-7ffda5c25cf9d962"]},{"id":204741,"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-7ffda5c25cf9d962"]}],"region_exact":{},"incoming_edges":[{"id":"e-7ffda5c25cf9d962","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-3388161425ab794b","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":"e69a7527c892c52aae8825764989ad6286c9687fea2cbc2ba3ac6c379fcd3589","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-6120ac587df8130e","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)).","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":[],"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:     3,      4;\n  2:     9,     20;\n  3:    27,     84,     32;\n  4:    81,    324,    256;\n  5:   243,   1188,   1440,    256;\n  6:   729,   4212,   6912,   2816;\n  7:  2187,  14580,  30240,  19968,   2048;\n  8:  6561,  49572, 124416, 115200,  28672;\n  9: 19683, 166212, 489888, 587520, 245760, 16384;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 8*x*P(n-2,x) + 3*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[8*x*P[n - 2, x] + 3*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = 8*x*v[i - 2] + 3*v[i - 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-6120ac587df8130e","steps":["basis A013611"],"edges":["e-7ffda5c25cf9d962"],"text":"A119808 \u2192 basis A013611"},"headline":"A119808 \u2192 basis A013611","chain":null}