{"id":"n-58d40e572a230dd2","revision":0,"first_index":0,"fingerprint":"f6-f1967bf6b49eedd7","name":"basis_map_A007318 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (2x+1)^n and q(n,x) = (2x+1)^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":true,"rows":[["1"],["3","1"],["15","14","3"],["75","115","57","9"],["375","800","630","216","27"],["1875","5125","5550","2970","783","81"],["9375","31250","43125","31500","12825","2754","243"],["46875","184375","309375","286875","158625","52245","9477","729"],["234375","1062500","2100000","2362500","1653750","737100","204120","32076","2187"],["1171875","6015625","13687500","18112500","15356250","8646750","3231900","772740","107163","6561"],["5859375","33593750","86484375","131625000","131118750","89302500","42099750","13559400","2854035","354294","19683"],["29296875","185546875","533203125","917578125","1050468750","839868750","478406250","194096250","54948375","10333575","1161297","59049"],["146484375","1015625000","3222656250","6187500000","8005078125","7350750000","4911637500","2405700000","857030625","216513000","36807210","3779136","177147"],["732421875","5517578125","19160156250","40605468750","58587890625","60768984375","46610437500","26763412500","11502253125","3653656875","833575050","129317310","12223143","531441"],["3662109375","29785156250","112353515625","260507812500","414755859375","479608593750","415359140625","273648375000","137801503125","52775043750","15128845875","3147311700","449067645","39326634","1594323"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","32","256","2048","16384","131072","1048576","8388608","67108864","536870912","4294967296","34359738368","274877906944","2199023255552"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-5","-3"],["5","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195439,"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-ed26907ffe89146f"]},{"id":195440,"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-ed26907ffe89146f"]},{"id":195441,"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-ed26907ffe89146f"]},{"id":195442,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-ed26907ffe89146f"]}],"region_exact":{},"incoming_edges":[{"id":"e-ed26907ffe89146f","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-58d40e572a230dd2","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":"81d3c7a6e8514ee7fc5be717a4e11abab2c67c061f37bf71978200787a95af88","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-5406e3c8f7504399","role":"sequence","name":"Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (2x+1)^n and q(n,x) = (2x+1)^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,       1;\n  2:      15,      14,        3;\n  3:      75,     115,       57,        9;\n  4:     375,     800,      630,      216,       27;\n  5:    1875,    5125,     5550,     2970,      783,      81;\n  6:    9375,   31250,    43125,    31500,    12825,    2754,     243;\n  7:   46875,  184375,   309375,   286875,   158625,   52245,    9477,    729;\n  8:  234375, 1062500,  2100000,  2362500,  1653750,  737100,  204120,  32076,   2187;\n  9: 1171875, 6015625, 13687500, 18112500, 15356250, 8646750, 3231900, 772740, 107163, 6561;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (5*n-5+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((5*n - 5 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = ((5*n - 5 + (3*n - 3)*x)*v[i - 1])/(n - 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-5406e3c8f7504399","steps":["basis A007318"],"edges":["e-ed26907ffe89146f"],"text":"A193730 \u2192 basis A007318"},"headline":"A193730 \u2192 basis A007318","chain":null}
