{"id":"n-ca41bee2bc8fcdbe","revision":1,"first_index":0,"fingerprint":"f6-1e7077c59c0f616e","name":"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"],["3","1"],["15","9","1"],["105","87","18","1"],["945","975","285","30","1"],["10395","12645","4680","705","45","1"],["135135","187425","82845","15960","1470","63","1"],["2027025","3133935","1595790","370125","43890","2730","84","1"],["34459425","58437855","33453945","8998290","1291815","103950","4662","108","1"],["654729075","1203216525","760970700","231416325","38710035","3786615","220500","7470","135","1"],["13749310575","27125492625","18705542625","6314962500","1199167200","137162025","9740115","429660","11385","165","1"],["316234143225","664761133575","494764058250","182894567625","38692476900","5039703900","419625360","22629915","782595","16665","198","1"],["7905853580625","17600023616175","14023390706325","5615811951750","1304976397725","189883593900","18048090060","1143782640","48455550","1349205","23595","234","1"],["213458046676875","500706514833525","424278354099600","182497749258825","46070080281225","7381251402525","785470565880","56936699820","2839726890","97026930","2222220","32487","273","1"],["6190283353629375","15234653491682625","13653335491921125","6264206330382000","1702810398539250","297032627967075","34872721208325","2835191759400","162006594750","6526750230","183693510","3521700","43680","315","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","25","211","2236","28471","422899","7173580","136750051","2893057381","67241818876","1702829138209","46659181547785","1375237342827076","43380198327693361"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A035342","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"],["2","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":158399,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0)","region_exact":null,"edges":["e-cf2bc165f5c18b21"]},{"id":158400,"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-cf2bc165f5c18b21"]},{"id":158401,"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-cf2bc165f5c18b21"]},{"id":158402,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"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 >= 1","region_exact":null,"edges":["e-cf2bc165f5c18b21"]},{"id":158403,"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 = 2, 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 = 2, and U_g","region_exact":null,"edges":["e-9a325246a0b0b95a"]}],"region_exact":{},"incoming_edges":[{"id":"e-9a325246a0b0b95a","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-ca41bee2bc8fcdbe","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":"1f7f0853cb54eb7f1a97429bab30a6a07c255601b3514822a8875fa89bc3f5ee","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 = 2, and U_g"}],"premises":[]},{"id":"e-cf2bc165f5c18b21","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-ca41bee2bc8fcdbe","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":"249c98bd4d0431a745fa7b31c397281e0bdd20e4369ff88715b21f64bafed6d6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-91082a28c5d8ee02","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-75126c0548fd070f","conclusion_name":"obreschkoff_combination of The convolution matrix of the double factorial of odd numbers (A001147)."},{"id":"e-91082a28c5d8ee02","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-75126c0548fd070f","conclusion_name":"obreschkoff_combination of The convolution matrix of the double factorial of odd numbers (A001147)."}],"used_by_total":2,"links":[{"id":"l-479557951a281c77","kind":"oeis_match","node_a_id":"n-ca41bee2bc8fcdbe","node_b_id":null,"fingerprint":null,"oeis_id":"A049118","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A049118","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-deb4f55b217c37bc","kind":"oeis_match","node_a_id":"n-ca41bee2bc8fcdbe","node_b_id":null,"fingerprint":null,"oeis_id":"A035342","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A035342","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A035342","relation":"identification"},{"oeis_id":"A049118","relation":"match_row_sums"},{"oeis_id":"A035342","relation":"match_triangle"}],"bfiles":[{"node_id":"n-ca41bee2bc8fcdbe","oeis_id":"A035342","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":32442},{"node_id":"n-ca41bee2bc8fcdbe","oeis_id":"A049118","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":18,"oeis_terms_available":18,"term_count":200,"raw_size":40695}],"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:         3,          1;\n  2:        15,          9,         1;\n  3:       105,         87,        18,         1;\n  4:       945,        975,       285,        30,        1;\n  5:     10395,      12645,      4680,       705,       45,       1;\n  6:    135135,     187425,     82845,     15960,     1470,      63,      1;\n  7:   2027025,    3133935,   1595790,    370125,    43890,    2730,     84,    1;\n  8:  34459425,   58437855,  33453945,   8998290,  1291815,  103950,   4662,  108,   1;\n  9: 654729075, 1203216525, 760970700, 231416325, 38710035, 3786615, 220500, 7470, 135, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n+1+x)*P(n-1,x) + 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 + 1 + x)*P[n - 1, x] + 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 + 1 + 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 - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A035342","target":"triangle","first_row":0,"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:         3,          1;\n   3:        15,          9,         1;\n   4:       105,         87,        18,         1;\n   5:       945,        975,       285,        30,        1;\n   6:     10395,      12645,      4680,       705,       45,       1;\n   7:    135135,     187425,     82845,     15960,     1470,      63,      1;\n   8:   2027025,    3133935,   1595790,    370125,    43890,    2730,     84,    1;\n   9:  34459425,   58437855,  33453945,   8998290,  1291815,  103950,   4662,  108,   1;\n  10: 654729075, 1203216525, 760970700, 231416325, 38710035, 3786615, 220500, 7470, 135, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1+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[(2*n - 1 + 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] = (2*n - 1 + 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":0,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-ca41bee2bc8fcdbe","steps":[],"edges":[],"text":"A035342"},"headline":"A035342: The convolution matrix of the double factorial of odd numbers (A001147).","chain":null}