{"id":"n-83eeed08410aaf7f","revision":0,"first_index":0,"fingerprint":"f6-6ec6238b9895326e","name":"shift_x_plus_one of Exponential Riordan array [1/sqrt(1-2x), x/(1-2x)].","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"],["2","1"],["10","8","1"],["76","78","18","1"],["764","928","300","32","1"],["9496","13100","5320","820","50","1"],["140152","214176","103140","20480","1830","72","1"],["2390480","3979528","2193576","527380","61460","3570","98","1"],["46206736","82796288","51015328","14287616","2038120","155456","6328","128","1"],["997313824","1906193808","1290859200","410223072","68833296","6466824","347088","10440","162","1"],["23758664096","48097014400","35348153040","12507325440","2402223600","267003072","17719800","704640","16290","200","1"],["618884638912","1319479621856","1042192946080","404771054160","87244064160","11158959504","879341232","43347480","1327260","24310","242","1"],["17492190577600","39094126591488","32929508437056","13883277084160","3308170702320","477200782080","43422108576","2547781632","96875460","2353120","34980","288","1"],["532985208200576","1243845768887488","1110279042208128","503659740748736","131133088783840","21008464160112","2162909850816","146883381216","6658907112","201112340","3968536","48828","338","1"],["17411277367391104","42289474443657728","39794733564040000","19283774937935872","5434535578568096","955409645077888","109581225529776","8438554375680","443495316264","15989445472","392676284","6418048","66430","392","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","19","173","2025","28787","479851","9156093","196506001","4680247715","122398824579","3484655325197","107230543328761","3545227970258067","125287685200499035"],"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"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["6","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":185324,"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-63da165006c0d751"]},{"id":185325,"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-63da165006c0d751"]},{"id":185326,"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-63da165006c0d751"]}],"region_exact":{},"incoming_edges":[{"id":"e-63da165006c0d751","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-83eeed08410aaf7f","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":"8de319b2918423c91104976a9b26f6029c5506e3ea56aa73022aa8b307144769","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-7d781fe2b71cdf22","role":"sequence","name":"Exponential Riordan array [1/sqrt(1-2x), x/(1-2x)].","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:         2,          1;\n  2:        10,          8,          1;\n  3:        76,         78,         18,         1;\n  4:       764,        928,        300,        32,        1;\n  5:      9496,      13100,       5320,       820,       50,       1;\n  6:    140152,     214176,     103140,     20480,     1830,      72,      1;\n  7:   2390480,    3979528,    2193576,    527380,    61460,    3570,     98,     1;\n  8:  46206736,   82796288,   51015328,  14287616,  2038120,  155456,   6328,   128,   1;\n  9: 997313824, 1906193808, 1290859200, 410223072, 68833296, 6466824, 347088, 10440, 162, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (6+4*x)*d/dx P(n-1,x) + (4+4*x)*d^2/dx^2 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 + x)*P[n - 1, x] + (6 + 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, 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 + x)*v[i - 1] + (6 + 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 - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-7d781fe2b71cdf22","steps":["x \u21a6 x+1"],"edges":["e-63da165006c0d751"],"text":"A176230 \u2192 x \u21a6 x+1"},"headline":"A176230 \u2192 x \u21a6 x+1","chain":null}