{"id":"n-8229dbdd6a4b5cd9","revision":2,"first_index":0,"fingerprint":"f6-217b33695a3e4949","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.","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"],["2","1"],["10","7","1"],["80","66","15","1"],["880","806","231","26","1"],["12320","12164","4040","595","40","1"],["209440","219108","80844","14155","1275","57","1"],["4188800","4591600","1835988","363944","39655","2415","77","1"],["96342400","109795600","46819324","10206700","1276009","95200","4186","100","1"],["2504902400","2951028000","1327098024","312193524","43382934","3751209","204036","6786","126","1"],["72642169600","88084714400","41436870696","10380710220","1570298610","152167995","9668253","400830","10440","155","1"],["2324549427200","2891353030400","1414064576672","373619597736","60630265740","6439674450","461552091","22494813","734910","15400","187","1"],["81359229952000","103521905491200","52383613213920","14490750497432","2495678898636","286018871490","22593997635","1248870546","48216663","1273910","21945","222","1"],["3091650738176000","4015191638617600","2094099207620160","603032132116336","109326548645600","13364396015256","1144590781620","70051078383","3081103740","96625243","2107820","30381","260","1"],["126757680265216000","167714507921497600","89873259151044160","26818416624389936","5085420626585936","657266785271096","60292618061676","4016684995323","196376331723","7042738703","183045863","3353441","41041","301","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","18","162","1944","29160","524880","11022480","264539520","7142567040","214277011200","7071141369600","254561089305600","9927882482918400","416971064282572800"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A225470","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159648,"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-9b3c7c87e4baebfb"]},{"id":159649,"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-8562aab4e97e2e3f","e-9b3c7c87e4baebfb","e-c0733b4d3f559bd0"]},{"id":159650,"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-8562aab4e97e2e3f","e-9b3c7c87e4baebfb","e-c0733b4d3f559bd0"]},{"id":159651,"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-9b3c7c87e4baebfb"]},{"id":159652,"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-8562aab4e97e2e3f","e-c0733b4d3f559bd0"]},{"id":159653,"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-c4f0d53850ef9f92"]}],"region_exact":{},"incoming_edges":[{"id":"e-8562aab4e97e2e3f","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-8229dbdd6a4b5cd9","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":"1da6f7ac835e04c2426e066aa35ec06ab0d84df6ca9a9549a9f473f24157ec78","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-260e022530e5976c","role":"sequence","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.","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-c4f0d53850ef9f92","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-8229dbdd6a4b5cd9","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":"350c6a330d73a4dc06505ded3b022085af3491ad0dfa1d0339704d5f9bf75e44","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-c0733b4d3f559bd0","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-8229dbdd6a4b5cd9","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":"758b0a38786772cbfcbb447a5d9a3a16ecb021b3e76bd8863c21c898d7aa8821","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-9b3c7c87e4baebfb","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-8229dbdd6a4b5cd9","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":"e1a03d4c8b776aa2cab5e0a11a1640d3bfe9c01333e7229cdaae07acc06385ab","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-0826250557dc6011","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-a33b47c8b957d83a","conclusion_name":"basis_map_A013609 of 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-586a1c2b8f137b51","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-a5324901f71bbafe","conclusion_name":"basis_map_A008277 of 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-6ce7f219250b8b1f","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-7ba399ade8b53e3c","conclusion_name":"basis_map_A013611 of 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-86f8b58a2aa07621","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-5b94261d6f603245","conclusion_name":"basis_map_A013610 of 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-b2419cddc44d1315","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-b6cbf920aaa38713","conclusion_name":"basis_map_A007318 of 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-763e8ee49ac3a70c","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-316709ce6ed88f32","conclusion_name":"obreschkoff_combination of 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-763e8ee49ac3a70c","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-316709ce6ed88f32","conclusion_name":"obreschkoff_combination of 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."}],"used_by_total":7,"links":[{"id":"l-19c605eebc5c0761","kind":"oeis_match","node_a_id":"n-8229dbdd6a4b5cd9","node_b_id":null,"fingerprint":null,"oeis_id":"A225470","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":"A225470","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-2a6dc6affda4cffd","kind":"oeis_match","node_a_id":"n-8229dbdd6a4b5cd9","node_b_id":null,"fingerprint":null,"oeis_id":"A032031","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":"A032031","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A225470","relation":"identification"},{"oeis_id":"A032031","relation":"match_row_sums"},{"oeis_id":"A225470","relation":"match_triangle"}],"bfiles":[{"node_id":"n-8229dbdd6a4b5cd9","oeis_id":"A032031","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":43553},{"node_id":"n-8229dbdd6a4b5cd9","oeis_id":"A225470","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":33427}],"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:          2,          1;\n  2:         10,          7,          1;\n  3:         80,         66,         15,         1;\n  4:        880,        806,        231,        26,        1;\n  5:      12320,      12164,       4040,       595,       40,       1;\n  6:     209440,     219108,      80844,     14155,     1275,      57,      1;\n  7:    4188800,    4591600,    1835988,    363944,    39655,    2415,     77,    1;\n  8:   96342400,  109795600,   46819324,  10206700,  1276009,   95200,   4186,  100,   1;\n  9: 2504902400, 2951028000, 1327098024, 312193524, 43382934, 3751209, 204036, 6786, 126, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*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[(3*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] = (3*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":"A225470","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:          2,          1;\n  2:         10,          7,          1;\n  3:         80,         66,         15,         1;\n  4:        880,        806,        231,        26,        1;\n  5:      12320,      12164,       4040,       595,       40,       1;\n  6:     209440,     219108,      80844,     14155,     1275,      57,      1;\n  7:    4188800,    4591600,    1835988,    363944,    39655,    2415,     77,    1;\n  8:   96342400,  109795600,   46819324,  10206700,  1276009,   95200,   4186,  100,   1;\n  9: 2504902400, 2951028000, 1327098024, 312193524, 43382934, 3751209, 204036, 6786, 126, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*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[(3*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] = (3*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-8229dbdd6a4b5cd9","steps":[],"edges":[],"text":"A225470"},"headline":"A225470: 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.","chain":null}