{"id":"n-d8d2e8dc229ab3a0","revision":0,"first_index":0,"fingerprint":"f6-8b691e53ceaa5ecb","name":"shift_x_plus_one of The convolution matrix of the double factorial of odd numbers (A001147).","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"],["4","1"],["25","11","1"],["211","126","21","1"],["2236","1639","381","34","1"],["28471","24305","7075","895","50","1"],["422899","407196","140190","22490","1800","69","1"],["7173580","7625611","2998086","574700","58835","3255","91","1"],["136750051","158056361","69311431","15302126","1885345","134246","5446","116","1"],["2893057381","3594556494","1728814221","428801709","61221636","5274171","276654","8586","144","1"],["67241818876","89025485185","46372502925","12693743490","2046935100","205284177","13080585","526800","12915","175","1"],["1702829138209","2385623954351","1332791791705","397291317555","71034347175","8078659743","601389327","29514705","941655","18700","209","1"],["46659181547785","68780259489096","40895668074756","13138377389500","2568715031520","325081135170","27529721142","1582907832","61699275","1598245","26235","246","1"],["1375237342827076","2123078042881081","1335065433900276","458460227275336","96962664073990","13461570818982","1272172008822","83425089462","3818465937","121096690","2597881","35841","286","1"],["43380198327693361","69860787539941139","46220552609515921","16852103590282324","3822498659885906","575750674791292","59843738762808","4389448046412","229616665278","8567215657","225406181","4070794","47866","329","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","37","359","4291","60797","994645","18434159","381445123","8712010997","217599390229","5898281073335","172396458620803","5403624821071661","180776363002325269"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"],["2","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":186194,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-f3fd4d1194d8180d"]},{"id":186195,"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-f3fd4d1194d8180d"]},{"id":186196,"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-f3fd4d1194d8180d"]},{"id":186197,"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-f3fd4d1194d8180d"]}],"region_exact":{},"incoming_edges":[{"id":"e-f3fd4d1194d8180d","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-d8d2e8dc229ab3a0","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":"af3a4ac247c5b45e4b12c5ef6d0cbbd8957358deabe2bd1100fb6e8fcd0ade05","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-ca41bee2bc8fcdbe","role":"sequence","name":"The convolution matrix of the double factorial of odd numbers (A001147).","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:          4,          1;\n  2:         25,         11,          1;\n  3:        211,        126,         21,         1;\n  4:       2236,       1639,        381,        34,        1;\n  5:      28471,      24305,       7075,       895,       50,       1;\n  6:     422899,     407196,     140190,     22490,     1800,      69,      1;\n  7:    7173580,    7625611,    2998086,    574700,    58835,    3255,     91,    1;\n  8:  136750051,  158056361,   69311431,  15302126,  1885345,  134246,   5446,  116,   1;\n  9: 2893057381, 3594556494, 1728814221, 428801709, 61221636, 5274171, 276654, 8586, 144, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n+2+x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(2*n + 2 + x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2*n + 2 + 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 - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-ca41bee2bc8fcdbe","steps":["x \u21a6 x+1"],"edges":["e-f3fd4d1194d8180d"],"text":"A035342 \u2192 x \u21a6 x+1"},"headline":"A035342 \u2192 x \u21a6 x+1","chain":null}