{"id":"n-5e7006e7019642f6","revision":0,"first_index":1,"fingerprint":"f6-fc5d9467c2602ff9","name":"shift_x_plus_one of Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["5","1"],["41","14","1"],["465","211","27","1"],["6721","3684","646","44","1"],["117941","74325","16090","1530","65","1"],["2433145","1710946","432895","51540","3095","90","1"],["57673281","44361639","12687941","1785315","135555","5621","119","1"],["1543866945","1280813416","404979932","65004296","5880070","310520","9436","152","1"],["46052954821","40778229289","14030204196","2508637684","260599206","16494366","641844","14916","189","1"],["1514472783561","1419794929750","525331085005","102874919960","11972680930","874741812","40988850","1225080","22485","230","1"],["54426342354385","53677752424571","21165669834815","4482468767205","574183185290","47208286510","2563860222","92622090","2194005","32615","275","1"],["2121878761891201","2190190026582284","913751952118786","207243622031380","28834203981935","2619522666552","160666490908","6749406312","193839855","3729660","45826","324","1"],["89187219264121525","95937363782584701","42103254833784222","10147808137427246","1517880414551215","150296245588775","10218093583412","486188712724","16281126147","380781115","6070350","62686","377","1"],["4020175011403931801","4490575099148001514","2063130510548940651","525121758951069644","83757549263829441","8943705009901662","664604245748443","35143966941512","1336234302403","36523228742","709269561","9522604","83811","434","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","56","704","11096","209952","4631712","116649472","3300864768","103647776512","3575363377664","134376283561984","5464685702785024","239054543628394496","11192404756014772224"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":188742,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-15f882978d05fe6b"]},{"id":188743,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-15f882978d05fe6b"]},{"id":188744,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-15f882978d05fe6b"]},{"id":188745,"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-15f882978d05fe6b"]}],"region_exact":{},"incoming_edges":[{"id":"e-15f882978d05fe6b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-5e7006e7019642f6","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"361a1949f243529fcc3df876cb07e97e3c1db809e52d83e636ce53a38d886ef3","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-df97cd413ec843e8","role":"sequence","name":"Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, 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":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:           1;\n   2:           5,           1;\n   3:          41,          14,           1;\n   4:         465,         211,          27,          1;\n   5:        6721,        3684,         646,         44,         1;\n   6:      117941,       74325,       16090,       1530,        65,        1;\n   7:     2433145,     1710946,      432895,      51540,      3095,       90,      1;\n   8:    57673281,    44361639,    12687941,    1785315,    135555,     5621,    119,     1;\n   9:  1543866945,  1280813416,   404979932,   65004296,   5880070,   310520,   9436,   152,   1;\n  10: 46052954821, 40778229289, 14030204196, 2508637684, 260599206, 16494366, 641844, 14916, 189, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n-1+x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(3*n - 1 + x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (3*n - 1 + x)*v[i - 1] + (1 + x)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-df97cd413ec843e8","steps":["x \u21a6 x+1"],"edges":["e-15f882978d05fe6b"],"text":"A035469 \u2192 x \u21a6 x+1"},"headline":"A035469 \u2192 x \u21a6 x+1","chain":null}