{"id":"n-4172472abe953cea","revision":1,"first_index":0,"fingerprint":"f6-678d8eaa2c857cae","name":"Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle.","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":true,"rows":[["1"],["1","1"],["5","6","1"],["45","59","15","1"],["585","812","254","28","1"],["9945","14389","5130","730","45","1"],["208845","312114","122119","20460","1675","66","1"],["5221125","8011695","3365089","633619","62335","3325","91","1"],["151412625","237560280","105599276","21740040","2441334","158760","5964","120","1"],["4996616625","7990901865","3722336388","823020596","102304062","7680414","355572","9924","153","1"],["184874815125","300659985630","145717348221","34174098440","4608270890","386479380","20836578","722760","15585","190","1"],["7579867420125","12511934225955","6275071262691","1546855384261","223113204930","20453925470","1240779078","50469738","1361745","23375","231","1"],["341094033905625","570616907588100","294890141047050","75883563554436","11586949606111","1143539851080","76288983980","3511917288","111748263","2413620","33770","276","1"],["16713607661375625","28301322505722525","15020233818893550","4013184755214414","643644094253875","67620402309031","4881700066100","248372931092","8987582175","230015643","4068350","47294","325","1"],["885821206052908125","1516683700464669450","824373714907080675","227719025845257492","38126321750669789","4227525416632518","326350505812331","18045465413976","724714786367","21178411254","445638193","6574932","64519","378","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","12","120","1680","30240","665280","17297280","518918400","17643225600","670442572800","28158588057600","1295295050649600","64764752532480000","3497296636753920000"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A290319","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","1"],["4","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159882,"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-d713510abde08ecc"]},{"id":159883,"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-0a4154652e7b3f7f","e-d713510abde08ecc"]},{"id":159884,"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-0a4154652e7b3f7f","e-d713510abde08ecc"]},{"id":159885,"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-d713510abde08ecc"]},{"id":159886,"position":4,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"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-0a4154652e7b3f7f"]},{"id":159887,"position":5,"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-b0148bc76d6ae768"]}],"region_exact":{},"incoming_edges":[{"id":"e-b0148bc76d6ae768","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-4172472abe953cea","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":"5219a7754ac70c79604351eb41bbd647aac1194098e00630282c1af52f8a3f92","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-0a4154652e7b3f7f","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-4172472abe953cea","premise_count":0,"theorem":"polytool parent provers, route root_domain: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"330d38b07090a27100ab22e7da89c52ffe74454e6459263e355cb02c40aa4155","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-d713510abde08ecc","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-4172472abe953cea","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":"4d22bbc75cd3c1ef99f110902c020986fc2d84f8b3e620175a89f6f2cc3379d2","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-3697d9eea9f962a2","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-d688f1d9440f85f8","conclusion_name":"basis_map_A008277 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."},{"id":"e-403803ced55fc794","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-fb74a9e290f1102e","conclusion_name":"basis_map_A013611 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."},{"id":"e-741861c2575e0643","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-1c1963609d82ab65","conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."},{"id":"e-9ff929e0a001a9a2","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-de50e58c7c589630","conclusion_name":"basis_map_A013609 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."},{"id":"e-d44172967618cc75","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-519925749fed9cdb","conclusion_name":"basis_map_A013610 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."},{"id":"e-0f7f0ded98411894","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-4ca244aa56ebfc37","conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."},{"id":"e-0f7f0ded98411894","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-4ca244aa56ebfc37","conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle."}],"used_by_total":7,"links":[{"id":"l-4bc12c6adb6a49e9","kind":"oeis_match","node_a_id":"n-4172472abe953cea","node_b_id":null,"fingerprint":null,"oeis_id":"A290319","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A290319","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-608361f96c997ffb","kind":"oeis_match","node_a_id":"n-4172472abe953cea","node_b_id":null,"fingerprint":null,"oeis_id":"A001813","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":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001813","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A290319","relation":"identification"},{"oeis_id":"A001813","relation":"match_row_sums"},{"oeis_id":"A290319","relation":"match_triangle"}],"bfiles":[{"node_id":"n-4172472abe953cea","oeis_id":"A001813","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":19,"oeis_terms_available":19,"term_count":200,"raw_size":45809},{"node_id":"n-4172472abe953cea","oeis_id":"A290319","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":34894}],"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:          5,          6,          1;\n  3:         45,         59,         15,         1;\n  4:        585,        812,        254,        28,         1;\n  5:       9945,      14389,       5130,       730,        45,       1;\n  6:     208845,     312114,     122119,     20460,      1675,      66,      1;\n  7:    5221125,    8011695,    3365089,    633619,     62335,    3325,     91,    1;\n  8:  151412625,  237560280,  105599276,  21740040,   2441334,  158760,   5964,  120,   1;\n  9: 4996616625, 7990901865, 3722336388, 823020596, 102304062, 7680414, 355572, 9924, 153, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-3+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(4*n - 3 + x)*P[n - 1, 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] = (4*n - 3 + x)*v[i - 1]); 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":"A290319","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:          1;\n  1:          1,          1;\n  2:          5,          6,          1;\n  3:         45,         59,         15,         1;\n  4:        585,        812,        254,        28,         1;\n  5:       9945,      14389,       5130,       730,        45,       1;\n  6:     208845,     312114,     122119,     20460,      1675,      66,      1;\n  7:    5221125,    8011695,    3365089,    633619,     62335,    3325,     91,    1;\n  8:  151412625,  237560280,  105599276,  21740040,   2441334,  158760,   5964,  120,   1;\n  9: 4996616625, 7990901865, 3722336388, 823020596, 102304062, 7680414, 355572, 9924, 153, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-3+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(4*n - 3 + x)*P[n - 1, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = (4*n - 3 + x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-4172472abe953cea","steps":[],"edges":[],"text":"A290319"},"headline":"A290319: Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle.","chain":null}