{"id":"n-3a40c713155476e9","revision":0,"first_index":0,"fingerprint":"f6-13ad852c44bed6fa","name":"basis_map_A013610 of Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, k-1).","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":false,"rows":[["1"],["2","3"],["4","12","9"],["12","54","72","27"],["24","144","306","270","81"],["48","360","1044","1458","972","243"],["96","864","3168","6048","6318","3402","729"],["192","2016","8928","21600","30780","25758","11664","2187"],["384","4608","23904","69984","126360","143856","100602","39366","6561"],["768","10368","61632","211680","462672","666792","632772","380538","131220","19683"],["1536","23040","154368","608256","1560384","2721600","3265920","2659392","1404054","433026","59049"],["3072","50688","377856","1679616","4945536","10124352","14696640","15116544","10786284","5078214","1417176","177147"],["6144","110592","907776","4492800","14929920","35085312","59766336","74323008","66922200","42515280","18068994","4605822","531441"],["12288","239616","2147328","11708928","43338240","114960384","224788608","327945024","356813424","285797160","163683828","63418626","14880348","1594323"],["24576","516096","5013504","29859840","121803264","359935488","794458368","1330255872","1697461920","1642034592","1184759136","617888736","220016574","47829690","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","25","165","825","4125","20625","103125","515625","2578125","12890625","64453125","322265625","1611328125","8056640625"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"],["4","12","9"],["12","54","72","27"]],"recurrence":{"denominator":{"coeffs":[["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["-6","-9"],["2","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201432,"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-68c56950fdd9227d"]},{"id":201433,"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-68c56950fdd9227d"]},{"id":201434,"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-68c56950fdd9227d"]},{"id":201435,"position":3,"claim":"interlacing","from_index":4,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":4,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 4","region_exact":null,"edges":["e-68c56950fdd9227d"]}],"region_exact":{},"incoming_edges":[{"id":"e-68c56950fdd9227d","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-3a40c713155476e9","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":"ecd01484f0ee5c9e62603d6713b27debfa8b7306d1421aab6945937db40b3bd8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":4,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-fc7cbd97dfcf0d00","role":"sequence","name":"Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, k-1).","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:   2,     3;\n  2:   4,    12,     9;\n  3:  12,    54,    72,     27;\n  4:  24,   144,   306,    270,     81;\n  5:  48,   360,  1044,   1458,    972,    243;\n  6:  96,   864,  3168,   6048,   6318,   3402,    729;\n  7: 192,  2016,  8928,  21600,  30780,  25758,  11664,   2187;\n  8: 384,  4608, 23904,  69984, 126360, 143856, 100602,  39366,   6561;\n  9: 768, 10368, 61632, 211680, 462672, 666792, 632772, 380538, 131220, 19683;\n","recurrence_sentence":"The row polynomials satisfy (n-3)*P(n,x) = (2*n-6+(3*n-9)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + 3*x, P(2,x) = 4 + 12*x + 9*x^2, P(3,x) = 12 + 54*x + 72*x^2 + 27*x^3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 3*x;\nP[2, x_] := 4 + 12*x + 9*x^2;\nP[3, x_] := 12 + 54*x + 72*x^2 + 27*x^3;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 6 + (3*n - 9)*x)*P[n - 1, x])/(n - 3)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 3*x; v[3] = 4 + 12*x + 9*x^2; v[4] = 12 + 54*x + 72*x^2 + 27*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((2*n - 6 + (3*n - 9)*x)*v[i - 1])/(n - 3)); 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-fc7cbd97dfcf0d00","steps":["basis A013610"],"edges":["e-68c56950fdd9227d"],"text":"A147644 \u2192 basis A013610"},"headline":"A147644 \u2192 basis A013610","chain":null}