{"id":"n-76ffafa4c38c7321","revision":0,"first_index":0,"fingerprint":"f6-1afcaeeccd1ccf36","name":"shift_x_plus_one of A triangular decomposition of the double factorial 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"],["1","1"],["3","4","1"],["15","27","13","1"],["105","240","174","40","1"],["945","2625","2550","990","121","1"],["10395","34020","41475","22800","5313","364","1"],["135135","509355","747495","532875","186165","27657","1093","1"],["2027025","8648640","14844060","13018320","6099030","1441440","141564","3280","1"],["34459425","164189025","322702380","336174300","198092790","64981350","10797900","717660","9841","1"],["654729075","3445942500","7631749125","9210801600","6549286590","2763852840","660417450","79173600","3617823","29524","1"],["13749310575","79222218075","195212642625","267901759125","223302749670","115543106910","36346138290","6497972250","572304315","18177687","88573","1"],["316234143225","1979900722800","5372706789450","8263370115000","7903871150175","4851601634880","1901867911020","458289271440","62487880455","4097018640","91154154","265720","1"],["7905853580625","53443570205025","158364559202850","269830874763450","291369841737975","207139834076175","97498307366460","29765464829100","5603572909935","591070054575","29134901250","456567930","797161","1"],["213458046676875","1549547301802500","4978474116791175","9308833231698000","11202475363053975","9057404172316500","4983851789791875","1849425653275200","448590344787585","66958932500460","5523574799925","206227148400","2285231133","2391484","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","8","56","560","7232","114368","2139776","46223360","1132124672","30999600128","938366468096","31114518056960","1121542540992512","43664751042265088"],"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":[["-1","-1"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180803,"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-cb1572a3f2776247"]},{"id":180804,"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-cb1572a3f2776247"]},{"id":180805,"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-cb1572a3f2776247"]}],"region_exact":{},"incoming_edges":[{"id":"e-cb1572a3f2776247","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-76ffafa4c38c7321","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":"5d05d9072116ff552871b52bd847d80db81e3a81f45241842231591e92b50de8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-84fc1826f57fd756","role":"sequence","name":"A triangular decomposition of the double factorial 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:        1,         1;\n  2:        3,         4,         1;\n  3:       15,        27,        13,         1;\n  4:      105,       240,       174,        40,         1;\n  5:      945,      2625,      2550,       990,       121,        1;\n  6:    10395,     34020,     41475,     22800,      5313,      364,        1;\n  7:   135135,    509355,    747495,    532875,    186165,    27657,     1093,      1;\n  8:  2027025,   8648640,  14844060,  13018320,   6099030,  1441440,   141564,   3280,    1;\n  9: 34459425, 164189025, 322702380, 336174300, 198092790, 64981350, 10797900, 717660, 9841, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1+(2*n-1)*x)*P(n-1,x) - (2*x+2*x^2)*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 - 1 + (2*n - 1)*x)*P[n - 1, x] - (2*x + 2*x^2)*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 - 1 + (2*n - 1)*x)*v[i - 1] - (2*x + 2*x^2)*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-54b58a0ddb0e34fe","steps":["reverse","x \u21a6 x+1"],"edges":["e-5c085bd25a6bcbdf","e-cb1572a3f2776247"],"text":"A185410 \u2192 reverse \u2192 x \u21a6 x+1"},"headline":"A185410 \u2192 reverse \u2192 x \u21a6 x+1","chain":null}