{"id":"n-6d6ed910d070f1d1","revision":1,"first_index":0,"fingerprint":"f6-2346fcd0d13b15a7","name":"basis_map_A013611 of Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..., and for k > 0 column k lists two zeros followed by the partial sums of column k-1.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1","4"],["1","8","16"],["1","12","48","64"],["2","28","144","320","256"],["3","52","352","1152","1792","1024"],["4","84","720","3200","7680","9216","4096"],["6","144","1456","8000","25600","47104","45056","16384"],["9","244","2848","18624","74240","183296","270336","212992","65536"],["13","396","5280","40320","193536","602112","1204224","1474560","983040","262144"],["19","640","9568","83392","467712","1756160","4444160","7421952","7733248","4456448","1048576"],["28","1032","17072","166976","1070080","4702208","14393344","30507008","43515904","39321600","19922944","4194304"],["41","1644","29856","324160","2338560","11778048","42319872","108822528","197591040","245104640","195035136","88080384","16777216"],["60","2600","51424","613760","4923136","27964416","115408896","349175808","771096576","1220542464","1335885824","947912704","385875968","67108864"],["88","4096","87600","1139520","10057216","63591424","296398848","1031700480","2685665280","5180489728","7248805888","7084179456","4529848320","1677721600","268435456"],["129","6420","147648","2079232","20024832","139493376","724725760","2853126144","8557756416","19490144256","33288093696","41649438720","36708548608","21340618752","7247757312","1073741824"]],"degrees":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],"row_sums":["5","25","125","750","4375","25000","143750","828125","4765625","27421875","157812500","908203125","5226562500","30078125000","173095703125"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1","4"],["1","8","16"],["1","12","48","64"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","8","16"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167646,"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-dee121250e432a7f"]},{"id":167647,"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-dee121250e432a7f"]},{"id":167648,"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-dee121250e432a7f"]}],"region_exact":{},"incoming_edges":[{"id":"e-dee121250e432a7f","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-6d6ed910d070f1d1","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":"43dde93cafbd7aa72299b6af06602ed627304e13ba86b97324b4b77d1b92a648","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-67a75673619cc276","role":"sequence","name":"Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..., and for k > 0 column k lists two zeros followed by the partial sums of column 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,   4;\n  1:  1,   8,   16;\n  2:  1,  12,   48,    64;\n  3:  2,  28,  144,   320,    256;\n  4:  3,  52,  352,  1152,   1792,    1024;\n  5:  4,  84,  720,  3200,   7680,    9216,    4096;\n  6:  6, 144, 1456,  8000,  25600,   47104,   45056,   16384;\n  7:  9, 244, 2848, 18624,  74240,  183296,  270336,  212992,   65536;\n  8: 13, 396, 5280, 40320, 193536,  602112, 1204224, 1474560,  983040,  262144;\n  9: 19, 640, 9568, 83392, 467712, 1756160, 4444160, 7421952, 7733248, 4456448, 1048576;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+8*x+16*x^2)*P(n-3,x) + (1+4*x)*P(n-1,x) for n >= 3, with P(0,x) = 1 + 4*x, P(1,x) = 1 + 8*x + 16*x^2, P(2,x) = 1 + 12*x + 48*x^2 + 64*x^3.","mathematica":"P[0, x_] := 1 + 4*x;\nP[1, x_] := 1 + 8*x + 16*x^2;\nP[2, x_] := 1 + 12*x + 48*x^2 + 64*x^3;\nP[n_, x_] := P[n, x] = Expand[(1 + 8*x + 16*x^2)*P[n - 3, x] + (1 + 4*x)*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 + 4*x; v[2] = 1 + 8*x + 16*x^2; v[3] = 1 + 12*x + 48*x^2 + 64*x^3; for(n = 3, N, my(i = n + 1); v[i] = (1 + 8*x + 16*x^2)*v[i - 3] + (1 + 4*x)*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-0d55e0bb3c384646","steps":["reverse","basis A013611"],"edges":["e-0e9e334768ea0a35","e-dee121250e432a7f"],"text":"A102547 \u2192 reverse \u2192 basis A013611"},"headline":"A102547 \u2192 reverse \u2192 basis A013611","chain":null}
