{"id":"n-42f2f1f6d4fd3019","revision":0,"first_index":0,"fingerprint":"f6-1636688c6972a6ab","name":"basis_map_A013609 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","2"],["9","10"],["27","42","8"],["81","162","64"],["243","594","360","32"],["729","2106","1728","352"],["2187","7290","7560","2496","128"],["6561","24786","31104","14400","1792"],["19683","83106","122472","73440","15360","512"],["59049","275562","466560","344736","103680","8704"],["177147","905418","1732104","1524096","604800","87552","2048"],["531441","2952450","6298560","6438528","3193344","677376","40960"],["1594323","9565938","22517352","26244000","15676416","4451328","473088","8192"],["4782969","30823578","79361856","103926240","72783360","26127360","4128768","188416"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","5","19","77","307","1229","4915","19661","78643","314573","1258291","5033165","20132659","80530637","322122547"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":199119,"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-05825bc088f68f52"]},{"id":199120,"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-05825bc088f68f52"]},{"id":199121,"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-05825bc088f68f52"]},{"id":199122,"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-05825bc088f68f52"]}],"region_exact":{},"incoming_edges":[{"id":"e-05825bc088f68f52","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-42f2f1f6d4fd3019","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":"f1c5a16c84f28d543faa374ecb2a118a6399b8d8d0a758731fec68c02483d58f","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,     2;\n  2:     9,    10;\n  3:    27,    42,      8;\n  4:    81,   162,     64;\n  5:   243,   594,    360,    32;\n  6:   729,  2106,   1728,   352;\n  7:  2187,  7290,   7560,  2496,   128;\n  8:  6561, 24786,  31104, 14400,  1792;\n  9: 19683, 83106, 122472, 73440, 15360, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 4*x*P(n-2,x) + 3*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 2*x;\nP[n_, x_] := P[n, x] = Expand[4*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 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = 4*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 A013609"],"edges":["e-05825bc088f68f52"],"text":"A119808 \u2192 basis A013609"},"headline":"A119808 \u2192 basis A013609","chain":null}