{"id":"n-5c56442adc0376c2","revision":1,"first_index":1,"fingerprint":"f6-e050e5a67817afb8","name":"Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(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"],["45","15","1"],["585","255","30","1"],["9945","5175","825","50","1"],["208845","123795","24150","2025","75","1"],["5221125","3427515","775845","80850","4200","105","1"],["151412625","108046575","27478710","3363045","219450","7770","140","1"],["4996616625","3824996175","1069801425","148548330","11482695","514710","13230","180","1"],["184874815125","150346471275","45547251750","7011734625","619338825","33100515","1083600","21150","225","1"],["7579867420125","6499426608675","2108878296525","354063575250","34881981750","2141962515","84029715","2098800","32175","275","1"],["341094033905625","306553491419175","105616706545350","19103929908525","2063280681000","141980107500","6427477980","193167315","3804075","47025","330","1"],["16713607661375625","15668768604864375","5693005525232025","1099021061788650","128457806001525","9730206486000","495491396400","17244847620","409999590","6531525","66495","390","1"],["885821206052908125","862827112324051875","328784072492625750","67238184985396425","8421116003875575","692809782189525","38964198873600","1530182253600","42254822610","814954140","10720710","91455","455","1"],["50491808745015763125","50929793720847916875","20261087389388971125","4363075171616411250","580926261221806500","51375322499626125","3147554311226325","136895863104000","4276745723250","96041795850","1533241710","16939650","122850","525","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","61","871","15996","358891","9509641","290528316","10051973371","388433817091","16579346005806","774580047063901","39313104018590221","2153825039102763846","126681355435102649161"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A049029","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","1"],["4","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158711,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0)","region_exact":null,"edges":["e-2c188005bc3e1dfc"]},{"id":158712,"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-2c188005bc3e1dfc"]},{"id":158713,"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-2c188005bc3e1dfc"]},{"id":158714,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-2c188005bc3e1dfc"]},{"id":158715,"position":4,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"(-inf, 0] -> (-inf, 0] through R_s, s = 4, and U_g"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: (-inf, 0] -> (-inf, 0] through R_s, s = 4, and U_g","region_exact":null,"edges":["e-77ef7b2dd3dc6607"]}],"region_exact":{},"incoming_edges":[{"id":"e-77ef7b2dd3dc6607","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-5c56442adc0376c2","premise_count":0,"theorem":"index-dependent scalar term: P_(k+1) = (L + k s) P_k with L f = (a + b t) f + kappa (t - h) f' gives T = U_g o R_s (RealRooted basisMap_factorization_of_scalarIndex_recurrence), where R_s(u^k) = u (u + s) ... (u + (k-1) s) keeps every root <= 0 for s >= 0 (Su, Yang and Zhang, Australas. J. Combin. 56 (2013), Theorem 4; Brenti, Mem. AMS 413 (1989), Theorem 2.4.3; RealRooted NewtonParametersAffine.preservesNonposRooted) and U_g(u^k) = L^k g sends (-inf, a + b h + kappa m] into (-inf, h] (RealRooted rayBasisMap_maps_realRootedIn_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"6327c4262761d15cf17fb9e9e8062dc5343a6bf1ab1bd5a0fcdafbf0f2a1fdd2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"(-inf, 0] -> (-inf, 0] through R_s, s = 4, and U_g"}],"premises":[]},{"id":"e-2c188005bc3e1dfc","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-5c56442adc0376c2","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"41f1188df2760cf1b5778d0ee3ab889e76d1a23becf90b233d254b6002cc8512","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-80d7320f7911dda9","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-367366cbd49283c0","conclusion_name":"obreschkoff_combination of Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0."},{"id":"e-80d7320f7911dda9","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-367366cbd49283c0","conclusion_name":"obreschkoff_combination of Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0."}],"used_by_total":2,"links":[{"id":"l-a8a85ebfc0e801fb","kind":"oeis_match","node_a_id":"n-5c56442adc0376c2","node_b_id":null,"fingerprint":null,"oeis_id":"A049120","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A049120","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c85e05faaf60dd82","kind":"oeis_match","node_a_id":"n-5c56442adc0376c2","node_b_id":null,"fingerprint":null,"oeis_id":"A049029","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":39},"in_catalog":true,"oeis_id":"A049029","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A049029","relation":"identification"},{"oeis_id":"A049120","relation":"match_row_sums"},{"oeis_id":"A049029","relation":"match_triangle"}],"bfiles":[{"node_id":"n-5c56442adc0376c2","oeis_id":"A049029","target":"triangle","oeis_offset":1,"first_row":1,"rows_used":44,"terms_matched":39,"oeis_terms_agreeing":39,"oeis_terms_available":39,"term_count":990,"raw_size":36103},{"node_id":"n-5c56442adc0376c2","oeis_id":"A049120","target":"row_sums","oeis_offset":1,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":18,"oeis_terms_available":18,"term_count":200,"raw_size":46312}],"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:           45,           15,           1;\n   4:          585,          255,          30,          1;\n   5:         9945,         5175,         825,         50,         1;\n   6:       208845,       123795,       24150,       2025,        75,        1;\n   7:      5221125,      3427515,      775845,      80850,      4200,      105,       1;\n   8:    151412625,    108046575,    27478710,    3363045,    219450,     7770,     140,     1;\n   9:   4996616625,   3824996175,  1069801425,  148548330,  11482695,   514710,   13230,   180,   1;\n  10: 184874815125, 150346471275, 45547251750, 7011734625, 619338825, 33100515, 1083600, 21150, 225, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-3+x)*P(n-1,x) + 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[(4*n - 3 + x)*P[n - 1, x] + 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] = (4*n - 3 + x)*v[i - 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}},{"oeis_id":"A049029","target":"triangle","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:            1;\n   2:            5,            1;\n   3:           45,           15,           1;\n   4:          585,          255,          30,          1;\n   5:         9945,         5175,         825,         50,         1;\n   6:       208845,       123795,       24150,       2025,        75,        1;\n   7:      5221125,      3427515,      775845,      80850,      4200,      105,       1;\n   8:    151412625,    108046575,    27478710,    3363045,    219450,     7770,     140,     1;\n   9:   4996616625,   3824996175,  1069801425,  148548330,  11482695,   514710,   13230,   180,   1;\n  10: 184874815125, 150346471275, 45547251750, 7011734625, 619338825, 33100515, 1083600, 21150, 225, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-3+x)*P(n-1,x) + 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[(4*n - 3 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];\nTable[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (4*n - 3 + x)*v[i - 1] + x*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); 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":true}}],"derivation":{"root":"n-5c56442adc0376c2","steps":[],"edges":[],"text":"A049029"},"headline":"A049029: Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0.","chain":null}