{"id":"n-4368dfcbecf30c52","revision":0,"first_index":0,"fingerprint":"f6-7a053419338fd233","name":"basis_map_A013610 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.","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","3"],["5","15","9"],["9","45","63","27"],["18","117","261","243","81"],["36","288","873","1269","891","243"],["72","684","2610","5157","5589","3159","729"],["144","1584","7272","18144","26649","23085","10935","2187"],["288","3600","19296","58104","107730","126117","91125","37179","6561"],["576","8064","49392","174096","389772","575424","560601","347733","124659","19683"],["1152","17856","122976","496368","1301832","2320164","2847474","2377269","1292517","413343","59049"],["2304","39168","299520","1361664","4092768","8545824","12655440","13296960","9716841","4704237","1358127","177147"],["4608","85248","716544","3621888","12270528","29369952","50948352","64560240","59324562","38558997","16828965","4428675","531441"],["9216","184320","1688832","9393408","35406720","95551488","190006560","281965536","312329844","255091680","149334921","59344245","14348907","1594323"],["18432","396288","3930624","23853312","98993664","297323136","666667584","1133950752","1470556296","1447172892","1063944882","566693253","206730549","46235367","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","29","144","720","3600","18000","90000","450000","2250000","11250000","56250000","281250000","1406250000","7031250000"],"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"],["5","15","9"],["9","45","63","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":201416,"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-61a471081578e583"]},{"id":201417,"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-61a471081578e583"]},{"id":201418,"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-61a471081578e583"]},{"id":201419,"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-61a471081578e583"]}],"region_exact":{},"incoming_edges":[{"id":"e-61a471081578e583","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-4368dfcbecf30c52","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":"d0ec7222f056188f55a2b0c4754fd45c64d8b58d071dc1a10c6732e976cb5a9b","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-ab5ae7f91c188f17","role":"sequence","name":"Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.","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:   5,   15,     9;\n  3:   9,   45,    63,     27;\n  4:  18,  117,   261,    243,     81;\n  5:  36,  288,   873,   1269,    891,    243;\n  6:  72,  684,  2610,   5157,   5589,   3159,    729;\n  7: 144, 1584,  7272,  18144,  26649,  23085,  10935,   2187;\n  8: 288, 3600, 19296,  58104, 107730, 126117,  91125,  37179,   6561;\n  9: 576, 8064, 49392, 174096, 389772, 575424, 560601, 347733, 124659, 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) = 3 + 3*x, P(2,x) = 5 + 15*x + 9*x^2, P(3,x) = 9 + 45*x + 63*x^2 + 27*x^3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 3*x;\nP[2, x_] := 5 + 15*x + 9*x^2;\nP[3, x_] := 9 + 45*x + 63*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] = 3 + 3*x; v[3] = 5 + 15*x + 9*x^2; v[4] = 9 + 45*x + 63*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-ab5ae7f91c188f17","steps":["basis A013610"],"edges":["e-61a471081578e583"],"text":"A202241 \u2192 basis A013610"},"headline":"A202241 \u2192 basis A013610","chain":null}
