{"id":"n-f3d7765079876101","revision":0,"first_index":1,"fingerprint":"f6-dbdc887cb9bc3435","name":"shift_x_plus_one of Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].","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"],["3","1"],["17","10","1"],["139","111","21","1"],["1473","1444","390","36","1"],["19091","21805","7510","1010","55","1"],["291793","376206","155535","27140","2175","78","1"],["5129307","7309435","3494211","742875","77945","4137","105","1"],["101817089","157985416","85145116","21203896","2732870","190904","7196","136","1"],["2250495523","3760091289","2243546460","637105476","96900426","8355438","415884","11700","171","1"],["54780588561","97706781010","63671385645","20220597720","3530772210","360909612","22243410","828120","18045","210","1"],["1455367098923","2752135656391","1938157779745","678314897205","133283632350","15707710326","1151022642","53172570","1535655","26675","253","1"],["41888448785857","83515660940460","63028600652226","24032188651900","5233751868015","696865765464","59039964060","3249323352","116614575","2687740","38082","300","1"],["1298019439099059","2715957018668101","2181595413070866","897960841109046","214182161687065","31726264758903","3044914890732","194128054692","8312129397","238324515","4484194","52806","351","1"],["43074477771208913","94219068670093654","80096370696660955","35323682145383996","9139963471119481","1488045465973066","159285568044603","11525415312840","572463718827","19603065482","459211753","7185724","71435","406","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","28","272","3344","49472","852928","16758016","369082624","8996922368","240294124544","6974172532736","218457925292032","7342688736329728","263513011737051136"],"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":[["3","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["8","4"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185805,"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-c7d60ec169549c5b"]},{"id":185806,"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-c7d60ec169549c5b"]},{"id":185807,"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-c7d60ec169549c5b"]}],"region_exact":{},"incoming_edges":[{"id":"e-c7d60ec169549c5b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-f3d7765079876101","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":"4fc4f97b06d710e16640e6d4c9346dc44b2887363f37f7d800ef7d8b0f39c060","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-24ab55cfc575f41e","role":"sequence","name":"Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].","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:          3,          1;\n   3:         17,         10,          1;\n   4:        139,        111,         21,         1;\n   5:       1473,       1444,        390,        36,        1;\n   6:      19091,      21805,       7510,      1010,       55,       1;\n   7:     291793,     376206,     155535,     27140,     2175,      78,      1;\n   8:    5129307,    7309435,    3494211,    742875,    77945,    4137,    105,     1;\n   9:  101817089,  157985416,   85145116,  21203896,  2732870,  190904,   7196,   136,   1;\n  10: 2250495523, 3760091289, 2243546460, 637105476, 96900426, 8355438, 415884, 11700, 171, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+x)*P(n-1,x) + (8+4*x)*d/dx P(n-1,x) + (4+4*x)*d^2/dx^2 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 + x)*P[n - 1, x] + (8 + 4*x)*D[P[n - 1, x], x] + (4 + 4*x)*D[P[n - 1, x], {x, 2}]];\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 + x)*v[i - 1] + (8 + 4*x)*deriv(v[i - 1], x) + (4 + 4*x)*deriv(deriv(v[i - 1], x), 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-24ab55cfc575f41e","steps":["x \u21a6 x+1"],"edges":["e-c7d60ec169549c5b"],"text":"A286724 \u2192 x \u21a6 x+1"},"headline":"A286724 \u2192 x \u21a6 x+1","chain":null}