{"id":"n-59281eca5ea2cc86","revision":0,"first_index":0,"fingerprint":"f6-32ce21d4b68ee7fe","name":"basis_map_A013611 of Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, k-1).","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"],["2","4"],["4","16","16"],["12","72","128","64"],["24","192","544","640","256"],["48","480","1856","3456","3072","1024"],["96","1152","5632","14336","19968","14336","4096"],["192","2688","15872","51200","97280","108544","65536","16384"],["384","6144","42496","165888","399360","606208","565248","294912","65536"],["768","13824","109568","501760","1462272","2809856","3555328","2850816","1310720","262144"],["1536","30720","274432","1441792","4931584","11468800","18350080","19922944","14024704","5767168","1048576"],["3072","67584","671744","3981312","15630336","42663936","82575360","113246208","107741184","67633152","25165824","4194304"],["6144","147456","1613824","10649600","47185920","147849216","335806464","556793856","668467200","566231040","320864256","109051904","16777216"],["12288","319488","3817472","27754496","136970240","484442112","1263009792","2456813568","3564109824","3806330880","2906652672","1501560832","469762048","67108864"],["24576","688128","8912896","70778880","384958464","1516765184","4463788032","9965666304","16955473920","21869101056","21038628864","14629732352","6945767424","2013265920","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","36","276","1656","9936","59616","357696","2146176","12877056","77262336","463574016","2781444096","16688664576","100131987456"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","4"],["4","16","16"],["12","72","128","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":204265,"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-7cd69fbfccf31b75"]},{"id":204266,"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-7cd69fbfccf31b75"]},{"id":204267,"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-7cd69fbfccf31b75"]},{"id":204268,"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-7cd69fbfccf31b75"]}],"region_exact":{},"incoming_edges":[{"id":"e-7cd69fbfccf31b75","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-59281eca5ea2cc86","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":"5fe591a2bcc05447bb709c98586561a63523b110ec004f82cb88802afa93ee96","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-fc7cbd97dfcf0d00","role":"sequence","name":"Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, 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;\n  1:   2,     4;\n  2:   4,    16,     16;\n  3:  12,    72,    128,     64;\n  4:  24,   192,    544,    640,     256;\n  5:  48,   480,   1856,   3456,    3072,    1024;\n  6:  96,  1152,   5632,  14336,   19968,   14336,    4096;\n  7: 192,  2688,  15872,  51200,   97280,  108544,   65536,   16384;\n  8: 384,  6144,  42496, 165888,  399360,  606208,  565248,  294912,   65536;\n  9: 768, 13824, 109568, 501760, 1462272, 2809856, 3555328, 2850816, 1310720, 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) = 2 + 4*x, P(2,x) = 4 + 16*x + 16*x^2, P(3,x) = 12 + 72*x + 128*x^2 + 64*x^3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 4*x;\nP[2, x_] := 4 + 16*x + 16*x^2;\nP[3, x_] := 12 + 72*x + 128*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] = 2 + 4*x; v[3] = 4 + 16*x + 16*x^2; v[4] = 12 + 72*x + 128*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-fc7cbd97dfcf0d00","steps":["basis A013611"],"edges":["e-7cd69fbfccf31b75"],"text":"A147644 \u2192 basis A013611"},"headline":"A147644 \u2192 basis A013611","chain":null}