{"id":"n-fb52313e0f83daf2","revision":0,"first_index":0,"fingerprint":"f6-d7a1d544fb3e3e25","name":"basis_map_A008277 of Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 0 <= k <= n.","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"],["3","2"],["9","14","3"],["27","76","37","4"],["81","376","316","76","5"],["243","1778","2316","936","135","6"],["729","8198","15639","9492","2261","218","7"],["2187","37228","100489","86236","30255","4760","329","8"],["6561","167440","625144","730696","354882","81152","9072","472","9"],["19683","748418","3804120","5905152","3819222","1191916","191808","16032","651","10"],["59049","3331550","22791723","46146552","38707522","15846452","3444646","411432","26697","870","11"],["177147","14789740","135033133","351859396","375531846","196277168","55368138","8863888","817179","42372","1133","12"],["531441","65535688","793503796","2633917300","3525910519","2306909792","821541872","169290936","20791507","1524600","64636","1444","13"],["1594323","290040242","4634755428","19442078472","32283646509","26050398354","11479093472","2961089392","465130601","45213454","2700412","95368","1807","14"],["4782969","1282554518","26948828991","141964466220","289852012167","285130905390","153115757949","48447977928","9463984947","1170605514","92307501","4577820","136773","2226","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","26","144","854","5414","36544","261492","1975428","15697012","130766504","1138761152","10339523544","97655837848","957478900928"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","-4","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-2"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196357,"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-171bd39f2bb51e98"]},{"id":196358,"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-171bd39f2bb51e98"]},{"id":196359,"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-171bd39f2bb51e98"]}],"region_exact":{},"incoming_edges":[{"id":"e-171bd39f2bb51e98","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-fb52313e0f83daf2","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"9bb8a8895c09441a508da99f5147678d867cf97763a64fd54723fcc5108adf87","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-b1a7dcc8610d7e32","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 0 <= k <= n.","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,     14,       3;\n  3:    27,     76,      37,       4;\n  4:    81,    376,     316,      76,       5;\n  5:   243,   1778,    2316,     936,     135,       6;\n  6:   729,   8198,   15639,    9492,    2261,     218,      7;\n  7:  2187,  37228,  100489,   86236,   30255,    4760,    329,     8;\n  8:  6561, 167440,  625144,  730696,  354882,   81152,   9072,   472,   9;\n  9: 19683, 748418, 3804120, 5905152, 3819222, 1191916, 191808, 16032, 651, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3+4*x+x^2)*P(n-2,x) - (4*x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (4+2*x)*P(n-1,x) + 2*x*d/dx 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[-(3 + 4*x + x^2)*P[n - 2, x] - (4*x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (4 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], 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] = -(3 + 4*x + x^2)*v[i - 2] - (4*x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (4 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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-b1a7dcc8610d7e32","steps":["basis A008277"],"edges":["e-171bd39f2bb51e98"],"text":"A330381 \u2192 basis A008277"},"headline":"A330381 \u2192 basis A008277","chain":null}