{"id":"n-6e51dca61d91ba2f","revision":0,"first_index":0,"fingerprint":"f6-b650a98d95e329e3","name":"basis_map_A013611 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","4"],["5","20","16"],["9","60","112","64"],["18","156","464","576","256"],["36","384","1552","3008","2816","1024"],["72","912","4640","12224","17664","13312","4096"],["144","2112","12928","43008","84224","97280","61440","16384"],["288","4800","34304","137728","340480","531456","512000","278528","65536"],["576","10752","87808","412672","1231872","2424832","3149824","2605056","1245184","262144"],["1152","23808","218624","1176576","4114432","9777152","15998976","17809408","12910592","5505024","1048576"],["2304","52224","532480","3227648","12935168","36012032","71106560","99614720","97058816","62652416","24117248","4194304"],["4608","113664","1273856","8585216","38780928","123764736","286261248","483655680","592576512","513540096","298844160","104857600","16777216"],["9216","245760","3002368","22265856","111902720","402653184","1067581440","2112356352","3119775744","3397386240","2651848704","1405091840","452984832","67108864"],["18432","528384","6987776","56541184","312868864","1252917248","3745775616","8495038464","14688976896","19273875456","18893242368","13417578496","6526337024","1946157056","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","41","245","1470","8820","52920","317520","1905120","11430720","68584320","411505920","2469035520","14814213120","88885278720"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"],["5","20","16"],["9","60","112","64"]],"recurrence":{"denominator":{"coeffs":[["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["-6","-12"],["2","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204249,"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-8da44b0cbaefa1a6"]},{"id":204250,"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-8da44b0cbaefa1a6"]},{"id":204251,"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-8da44b0cbaefa1a6"]},{"id":204252,"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-8da44b0cbaefa1a6"]}],"region_exact":{},"incoming_edges":[{"id":"e-8da44b0cbaefa1a6","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-6e51dca61d91ba2f","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":"cf7bb3c42a09affc49545dc08f8784e4ed6f22f443ab8c672ca427f6da3836e7","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,     4;\n  2:   5,    20,    16;\n  3:   9,    60,   112,     64;\n  4:  18,   156,   464,    576,     256;\n  5:  36,   384,  1552,   3008,    2816,    1024;\n  6:  72,   912,  4640,  12224,   17664,   13312,    4096;\n  7: 144,  2112, 12928,  43008,   84224,   97280,   61440,   16384;\n  8: 288,  4800, 34304, 137728,  340480,  531456,  512000,  278528,   65536;\n  9: 576, 10752, 87808, 412672, 1231872, 2424832, 3149824, 2605056, 1245184, 262144;\n","recurrence_sentence":"The row polynomials satisfy (n-3)*P(n,x) = (2*n-6+(4*n-12)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 3 + 4*x, P(2,x) = 5 + 20*x + 16*x^2, P(3,x) = 9 + 60*x + 112*x^2 + 64*x^3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 4*x;\nP[2, x_] := 5 + 20*x + 16*x^2;\nP[3, x_] := 9 + 60*x + 112*x^2 + 64*x^3;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 6 + (4*n - 12)*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 + 4*x; v[3] = 5 + 20*x + 16*x^2; v[4] = 9 + 60*x + 112*x^2 + 64*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((2*n - 6 + (4*n - 12)*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 A013611"],"edges":["e-8da44b0cbaefa1a6"],"text":"A202241 \u2192 basis A013611"},"headline":"A202241 \u2192 basis A013611","chain":null}
