{"id":"n-260e022530e5976c","revision":2,"first_index":0,"fingerprint":"f6-bd2d0bf77d88a374","name":"Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*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"],["4","5","1"],["28","39","12","1"],["280","418","159","22","1"],["3640","5714","2485","445","35","1"],["58240","95064","45474","9605","1005","51","1"],["1106560","1864456","959070","227969","28700","1974","70","1"],["24344320","42124592","22963996","5974388","859369","72128","3514","92","1"],["608608000","1077459120","616224492","172323696","27458613","2662569","159978","5814","117","1"],["17041024000","30777463360","18331744896","5441287980","941164860","102010545","7141953","322770","9090","145","1"],["528271744000","971142388160","599061555136","187011672276","34617398640","4103491755","323411088","17147823","604560","13585","176","1"],["17961239296000","33547112941440","21339235262784","6957458412520","1364003226036","174136118310","15099468747","906437070","37702863","1066450","19569","210","1"],["664565853952000","1259204418129280","823098817664448","278765196526024","57425577775852","7807039603506","732816461949","48637640337","2301443001","77161513","1790503","27339","247","1"],["26582634158080000","51032742579123200","34183157124707200","11973706678705408","2575788307560104","369707161916092","37119698081466","2678322075429","140695360377","5387903521","148781633","2884063","37219","287","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","10","80","880","12320","209440","4188800","96342400","2504902400","72642169600","2324549427200","81359229952000","3091650738176000","126757680265216000"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A286718","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-2","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159868,"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-1844ef33b5ef77b8"]},{"id":159869,"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-1844ef33b5ef77b8","e-576aa1dc371fa216","e-fe032cf3f375eb62"]},{"id":159870,"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-1844ef33b5ef77b8","e-576aa1dc371fa216","e-fe032cf3f375eb62"]},{"id":159871,"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-1844ef33b5ef77b8"]},{"id":159872,"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-576aa1dc371fa216","e-fe032cf3f375eb62"]},{"id":159873,"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 = 3, 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 = 3, and U_g","region_exact":null,"edges":["e-efc8327ed3955ae4"]}],"region_exact":{},"incoming_edges":[{"id":"e-fe032cf3f375eb62","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-260e022530e5976c","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"228d828d30b99faaee6040438ae1243ff07706f4d6260d2e970c71cbc786f53c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-1a0f876fa1441737","role":"sequence","name":"basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1)} and m = 3. shifted by x ->  x + 1","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]"}]},{"id":"e-efc8327ed3955ae4","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-260e022530e5976c","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":"77b4847d9d4477c774065b795c89c5af2e89d48b58d37cff865d2aa3261a08b0","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 = 3, and U_g"}],"premises":[]},{"id":"e-576aa1dc371fa216","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-260e022530e5976c","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":"0c2d789b3c99612f3ca0352e4950835273d9e57d58e202218658b5aa385bfc66","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-1844ef33b5ef77b8","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-260e022530e5976c","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":"588d3b19c69907e7fb17cca8814eacef7012d6cc1222fce03fdf2eedbf41a2c2","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-4c9f13aa30e5695d","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-7c95902cf1293962","conclusion_name":"basis_map_A013611 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle."},{"id":"e-74e855bf9275ded5","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-91d95920b3c3b094","conclusion_name":"basis_map_A008277 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle."},{"id":"e-8562aab4e97e2e3f","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-8229dbdd6a4b5cd9","conclusion_name":"Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-ccb031147de5168b","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-96d72c9c3aa93ee7","conclusion_name":"basis_map_A013610 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle."},{"id":"e-dabb8392a3e47d84","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-f1ff6363886186a4","conclusion_name":"basis_map_A013609 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle."},{"id":"e-38cf740a66d8523a","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-5d0c50b73be837bc","conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle."},{"id":"e-38cf740a66d8523a","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-5d0c50b73be837bc","conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle."}],"used_by_total":7,"links":[{"id":"l-d6aabcfe4d3ff066","kind":"oeis_match","node_a_id":"n-260e022530e5976c","node_b_id":null,"fingerprint":null,"oeis_id":"A286718","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":"A286718","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e7bf3d40a2e20e14","kind":"oeis_match","node_a_id":"n-260e022530e5976c","node_b_id":null,"fingerprint":null,"oeis_id":"A008544","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":"A008544","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A286718","relation":"identification"},{"oeis_id":"A008544","relation":"match_row_sums"},{"oeis_id":"A286718","relation":"match_triangle"}],"bfiles":[{"node_id":"n-260e022530e5976c","oeis_id":"A008544","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":17,"oeis_terms_available":17,"term_count":200,"raw_size":43409},{"node_id":"n-260e022530e5976c","oeis_id":"A286718","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":33208}],"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:         4,          5,         1;\n  3:        28,         39,        12,         1;\n  4:       280,        418,       159,        22,        1;\n  5:      3640,       5714,      2485,       445,       35,       1;\n  6:     58240,      95064,     45474,      9605,     1005,      51,      1;\n  7:   1106560,    1864456,    959070,    227969,    28700,    1974,     70,    1;\n  8:  24344320,   42124592,  22963996,   5974388,   859369,   72128,   3514,   92,   1;\n  9: 608608000, 1077459120, 616224492, 172323696, 27458613, 2662569, 159978, 5814, 117, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n-2+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[(3*n - 2 + 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] = (3*n - 2 + 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":"A286718","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:         4,          5,         1;\n  3:        28,         39,        12,         1;\n  4:       280,        418,       159,        22,        1;\n  5:      3640,       5714,      2485,       445,       35,       1;\n  6:     58240,      95064,     45474,      9605,     1005,      51,      1;\n  7:   1106560,    1864456,    959070,    227969,    28700,    1974,     70,    1;\n  8:  24344320,   42124592,  22963996,   5974388,   859369,   72128,   3514,   92,   1;\n  9: 608608000, 1077459120, 616224492, 172323696, 27458613, 2662569, 159978, 5814, 117, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n-2+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[(3*n - 2 + 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] = (3*n - 2 + 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-260e022530e5976c","steps":[],"edges":[],"text":"A286718"},"headline":"A286718: Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1 triangle.","chain":null}