{"id":"n-43f9a7f73cb3c4ce","revision":0,"first_index":0,"fingerprint":"f6-9a823f2771231d0b","name":"basis_map_A013610 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","3"],["9","15"],["27","63","18"],["81","243","144"],["243","891","810","108"],["729","3159","3888","1188"],["2187","10935","17010","8424","648"],["6561","37179","69984","48600","9072"],["19683","124659","275562","247860","77760","3888"],["59049","413343","1049760","1163484","524880","66096"],["177147","1358127","3897234","5143824","3061800","664848","23328"],["531441","4428675","14171760","21730032","16166304","5143824","466560"],["1594323","14348907","50664042","88573500","79361856","33802272","5388768","139968"],["4782969","46235367","178564176","350751060","368465760","198404640","47029248","3219264"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","6","24","108","468","2052","8964","39204","171396","749412","3276612","14326308","62638596","273873636","1197452484"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","6"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201908,"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-5ed634138faa513c"]},{"id":201909,"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-5ed634138faa513c"]},{"id":201910,"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-5ed634138faa513c"]},{"id":201911,"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-5ed634138faa513c"]}],"region_exact":{},"incoming_edges":[{"id":"e-5ed634138faa513c","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-43f9a7f73cb3c4ce","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":"452c1198f84a0a77f13f7c4c1c8191c3468fc44724ee43ea001aed32bb0af678","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,      3;\n  2:     9,     15;\n  3:    27,     63,     18;\n  4:    81,    243,    144;\n  5:   243,    891,    810,    108;\n  6:   729,   3159,   3888,   1188;\n  7:  2187,  10935,  17010,   8424,   648;\n  8:  6561,  37179,  69984,  48600,  9072;\n  9: 19683, 124659, 275562, 247860, 77760, 3888;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 6*x*P(n-2,x) + 3*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 3*x;\nP[n_, x_] := P[n, x] = Expand[6*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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = 6*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 A013610"],"edges":["e-5ed634138faa513c"],"text":"A119808 \u2192 basis A013610"},"headline":"A119808 \u2192 basis A013610","chain":null}