{"id":"n-3c823179bb708635","revision":0,"first_index":0,"fingerprint":"f6-c913de3b43fe0d44","name":"basis_map_A013611 of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=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":false,"rows":[["1"],["2","4"],["5","20","16"],["14","84","144","64"],["41","328","880","896","256"],["122","1220","4480","7360","5120","1024"],["365","4380","20448","46784","53760","27648","4096"],["1094","15316","86800","255360","413952","358400","143360","16384"],["3281","52496","349984","1260032","2648832","3268608","2236416","720896","65536"],["9842","177156","1358208","5787264","14980608","24136704","23740416","13271040","3538944","262144"],["29525","590500","5117680","25194880","77553920","154639360","199741440","161710080","75694080","17039360","1048576"],["88574","1948628","18836752","105226176","375654400","894215168","1435529216","1533886464","1046740992","418119680","80740352","4194304"],["265721","6377304","68024592","425153920","1727543808","4784412672","9200078848","12263522304","11094589440","6499598336","2249195520","377487360","16777216"],["797162","20726212","241805824","1671914816","7620341248","24083884032","54027976704","86519267328","97971208192","76397674496","38986055680","11832131584","1744830464","67108864"],["2391485","66961580","848180032","6428312128","32483811584","115412039680","296129089536","554558767104","756391673856","740510138368","504869421056","227100590080","61069066240","7985954816","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","41","306","2401","19326","157481","1290666","10606081","87262326","718359401","5915180706","48713027041","401185722606","3304124833001"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","-12","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204665,"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-f4298ff451e78d20"]},{"id":204666,"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-f4298ff451e78d20"]},{"id":204667,"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-f4298ff451e78d20"]},{"id":204668,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-f4298ff451e78d20"]}],"region_exact":{},"incoming_edges":[{"id":"e-f4298ff451e78d20","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-3c823179bb708635","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":"346d94c5d664bc6221aea0fe31aaa6d755b2350f6c311cba333d890e5f67d13e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-a6f3b35778192ffb","role":"sequence","name":"Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=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:    2,      4;\n  2:    5,     20,      16;\n  3:   14,     84,     144,      64;\n  4:   41,    328,     880,     896,      256;\n  5:  122,   1220,    4480,    7360,     5120,     1024;\n  6:  365,   4380,   20448,   46784,    53760,    27648,     4096;\n  7: 1094,  15316,   86800,  255360,   413952,   358400,   143360,    16384;\n  8: 3281,  52496,  349984, 1260032,  2648832,  3268608,  2236416,   720896,   65536;\n  9: 9842, 177156, 1358208, 5787264, 14980608, 24136704, 23740416, 13271040, 3538944, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3+12*x+16*x^2)*P(n-2,x) + (4+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-(3 + 12*x + 16*x^2)*P[n - 2, x] + (4 + 8*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; v[2] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 12*x + 16*x^2)*v[i - 2] + (4 + 8*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-a6f3b35778192ffb","steps":["basis A013611"],"edges":["e-f4298ff451e78d20"],"text":"A056241 \u2192 basis A013611"},"headline":"A056241 \u2192 basis A013611","chain":null}