{"id":"n-dbecd7b06e6b1292","revision":0,"first_index":0,"fingerprint":"f6-4465f9855f0257a8","name":"basis_map_A013611 of Riordan array (1, x/(1-x)^2).","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"],["1","4"],["3","16","16"],["8","56","112","64"],["21","184","544","640","256"],["55","580","2256","4032","3328","1024"],["144","1776","8544","20480","25856","16384","4096"],["377","5324","30480","91584","156160","151552","77824","16384"],["987","15704","104192","376192","808960","1062912","835584","360448","65536"],["2584","45736","344912","1453760","3775488","6273024","6680576","4407296","1638400","262144"],["6765","131840","1113488","5364736","16332544","32858112","44298240","39583744","22478848","7340032","1048576"],["17711","376844","3522912","19094400","66681088","157631488","257646592","291536896","224133120","111673344","32505856","4194304"],["46368","1069536","10962624","66010112","260088320","706760704","1359167488","1865613312","1816068096","1224212480","543162368","142606336","16777216"],["121393","3017236","33643104","222786432","977624320","3003003904","6646898688","10741972992","12686524416","10825236480","6493831168","2596274176","620756992","67108864"],["317811","8467744","102035632","736921600","3563930368","12212748288","30593544192","56947900416","79211397120","81997594624","62239277056","33621540864","12230590464","2684354560","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","35","240","1645","11275","77280","529685","3630515","24883920","170556925","1169014555","8012544960","54918800165","376419056195"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","4"],["3","16","16"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["2"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-6","-8"],["3","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204505,"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-d750ab167b0af857"]},{"id":204506,"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-d750ab167b0af857"]},{"id":204507,"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-d750ab167b0af857"]},{"id":204508,"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-d750ab167b0af857"]}],"region_exact":{},"incoming_edges":[{"id":"e-d750ab167b0af857","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-dbecd7b06e6b1292","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":"12dce117dd22bb521ab7008f7215ab18048c8120dcf70fe760bad582f7ba6794","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-83d230649c15eed8","role":"sequence","name":"Riordan array (1, x/(1-x)^2).","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:    1,     4;\n  2:    3,    16,     16;\n  3:    8,    56,    112,      64;\n  4:   21,   184,    544,     640,     256;\n  5:   55,   580,   2256,    4032,    3328,    1024;\n  6:  144,  1776,   8544,   20480,   25856,   16384,    4096;\n  7:  377,  5324,  30480,   91584,  156160,  151552,   77824,   16384;\n  8:  987, 15704, 104192,  376192,  808960, 1062912,  835584,  360448,   65536;\n  9: 2584, 45736, 344912, 1453760, 3775488, 6273024, 6680576, 4407296, 1638400, 262144;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = -(n-2)*P(n-2,x) + (3*n-6+(4*n-8)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + 4*x, P(2,x) = 3 + 16*x + 16*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 4*x;\nP[2, x_] := 3 + 16*x + 16*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 2)*P[n - 2, x] + (3*n - 6 + (4*n - 8)*x)*P[n - 1, x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 4*x; v[3] = 3 + 16*x + 16*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(n - 2)*v[i - 2] + (3*n - 6 + (4*n - 8)*x)*v[i - 1])/(n - 2)); 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-83d230649c15eed8","steps":["basis A013611"],"edges":["e-d750ab167b0af857"],"text":"A128908 \u2192 basis A013611"},"headline":"A128908 \u2192 basis A013611","chain":null}