{"id":"n-9c5c208df8605708","revision":1,"first_index":0,"fingerprint":"f6-83c2ad05f3223159","name":"Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.","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"],["3","1"],["21","10","1"],["231","131","21","1"],["3465","2196","446","36","1"],["65835","45189","10670","1130","55","1"],["1514205","1105182","290599","36660","2395","78","1"],["40883535","31354119","8951355","1280419","101325","4501","105","1"],["1267389585","1012861224","308846124","48644344","4421494","240856","7756","136","1"],["44358635475","36717532425","11822475564","2011398164","203396634","12851454","512316","12516","171","1"],["1729986783525","1476342400050","497794079421","90267003960","9943866890","704603340","32831778","1000440","19185","210","1"],["74389431691575","65212709985675","22881487815153","4379275249701","517853280230","40241810510","2116369794","75850698","1825395","28215","253","1"],["3496303289504025","3139386801018300","1140642637297866","228707424551100","28718379420511","2409218374200","139711190828","5681352600","161644263","3151500","40106","300","1"],["178311467764705275","163605030141437325","61312161303209466","12804721289403966","1693344774997161","151588516504711","9534489106428","429460173428","13925210013","322370763","5196906","55406","351","1"],["9807130727058790125","9176588125543758150","3535773901817957955","765571832220427596","105938683914247821","10030713182756266","675985417358251","33154798644968","1195346724143","31655601978","608200593","8244236","74711","406","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","32","384","6144","122880","2949120","82575360","2642411520","95126814720","3805072588800","167423193907200","8036313307545600","417888291992371200","23401744351572787200"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A225471","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","1"],["4","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159654,"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-dad3570ee638379f"]},{"id":159655,"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-381fad74fe44e78a","e-dad3570ee638379f"]},{"id":159656,"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-381fad74fe44e78a","e-dad3570ee638379f"]},{"id":159657,"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-dad3570ee638379f"]},{"id":159658,"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-381fad74fe44e78a"]},{"id":159659,"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-836bdd982143692b"]}],"region_exact":{},"incoming_edges":[{"id":"e-836bdd982143692b","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-9c5c208df8605708","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":"11922840a912415135fc7b24d3b2d84490683ed44d79b8629b9e7f36f0f5dd81","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-381fad74fe44e78a","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-9c5c208df8605708","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":"c16a58eeba924fd57150f645200f43efd77078331b98fc59add8d0d17eb010b8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-dad3570ee638379f","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-9c5c208df8605708","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":"aa312638377415374b33604f1021b2041d69fbb4868d5b31e4dac1464304ca5f","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-2dc9098c1ed2fab8","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-61bf3ec06b6c88be","conclusion_name":"basis_map_A007318 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-3a6a7b6037078bc1","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-f4c6c763b9527d17","conclusion_name":"basis_map_A008277 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-8d6d917622b49386","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-bf0f86dc9ba61887","conclusion_name":"basis_map_A013609 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-a967cf092a6717a9","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-f4e656360cd62235","conclusion_name":"basis_map_A013611 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-bf3b7a758db4c427","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-a06f8ee83f308dcc","conclusion_name":"basis_map_A013610 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-6a5312030eb510ce","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-6ec7c64ebc7ea311","conclusion_name":"obreschkoff_combination of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."},{"id":"e-6a5312030eb510ce","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-6ec7c64ebc7ea311","conclusion_name":"obreschkoff_combination of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0."}],"used_by_total":7,"links":[{"id":"l-aeaa374550e02fc1","kind":"oeis_match","node_a_id":"n-9c5c208df8605708","node_b_id":null,"fingerprint":null,"oeis_id":"A225471","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":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A225471","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-b7d15d42d0542de4","kind":"oeis_match","node_a_id":"n-9c5c208df8605708","node_b_id":null,"fingerprint":null,"oeis_id":"A047053","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":"A047053","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A225471","relation":"identification"},{"oeis_id":"A047053","relation":"match_row_sums"},{"oeis_id":"A225471","relation":"match_triangle"}],"bfiles":[{"node_id":"n-9c5c208df8605708","oeis_id":"A047053","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":46044},{"node_id":"n-9c5c208df8605708","oeis_id":"A225471","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":35261}],"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:          21,          10,           1;\n  3:         231,         131,          21,          1;\n  4:        3465,        2196,         446,         36,         1;\n  5:       65835,       45189,       10670,       1130,        55,        1;\n  6:     1514205,     1105182,      290599,      36660,      2395,       78,      1;\n  7:    40883535,    31354119,     8951355,    1280419,    101325,     4501,    105,     1;\n  8:  1267389585,  1012861224,   308846124,   48644344,   4421494,   240856,   7756,   136,   1;\n  9: 44358635475, 36717532425, 11822475564, 2011398164, 203396634, 12851454, 512316, 12516, 171, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-1+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 - 1 + 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 - 1 + 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":"A225471","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:           3,           1;\n  2:          21,          10,           1;\n  3:         231,         131,          21,          1;\n  4:        3465,        2196,         446,         36,         1;\n  5:       65835,       45189,       10670,       1130,        55,        1;\n  6:     1514205,     1105182,      290599,      36660,      2395,       78,      1;\n  7:    40883535,    31354119,     8951355,    1280419,    101325,     4501,    105,     1;\n  8:  1267389585,  1012861224,   308846124,   48644344,   4421494,   240856,   7756,   136,   1;\n  9: 44358635475, 36717532425, 11822475564, 2011398164, 203396634, 12851454, 512316, 12516, 171, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-1+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 - 1 + 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 - 1 + 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-9c5c208df8605708","steps":[],"edges":[],"text":"A225471"},"headline":"A225471: Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.","chain":null}