{"id":"n-58396b904b0e2464","revision":0,"first_index":0,"fingerprint":"f6-0ea546b1e417769a","name":"basis_map_A013609 of basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["3"],["15","12"],["45","36"],["225","360","144"],["675","1080","432"],["3375","8100","6480","1728"],["10125","24300","19440","5184"],["50625","162000","194400","103680","20736"],["151875","486000","583200","311040","62208"],["759375","3037500","4860000","3888000","1555200","248832"],["2278125","9112500","14580000","11664000","4665600","746496"],["11390625","54675000","109350000","116640000","69984000","22394880","2985984"],["34171875","164025000","328050000","349920000","209952000","67184640","8957952"],["170859375","956812500","2296350000","3061800000","2449440000","1175731200","313528320","35831808"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","27","81","729","2187","19683","59049","531441","1594323","14348907","43046721","387420489","1162261467","10460353203"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["15","12"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":199399,"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-71c84dd943cacd94"]},{"id":199400,"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-71c84dd943cacd94"]},{"id":199401,"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-71c84dd943cacd94"]}],"region_exact":{},"incoming_edges":[{"id":"e-71c84dd943cacd94","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-58396b904b0e2464","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":"9a790c27935e8f7923af2484883f73fd5d3881bdf08e26d6452da5581d01736d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-1a86492085c1e21c","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=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;\n  2:     15,     12;\n  3:     45,     36;\n  4:    225,    360,    144;\n  5:    675,   1080,    432;\n  6:   3375,   8100,   6480,   1728;\n  7:  10125,  24300,  19440,   5184;\n  8:  50625, 162000, 194400, 103680, 20736;\n  9: 151875, 486000, 583200, 311040, 62208;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (15+12*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[(15 + 12*x)*P[n - 2, 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; for(n = 2, N, my(i = n + 1); v[i] = (15 + 12*x)*v[i - 2]); 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-7c641d81e21514ce","steps":["x \u21a6 x+1","basis A013609"],"edges":["e-94bbecf72edd8f15","e-71c84dd943cacd94"],"text":"A274498 \u2192 x \u21a6 x+1 \u2192 basis A013609"},"headline":"A274498 \u2192 x \u21a6 x+1 \u2192 basis A013609","chain":null}
