{"id":"n-7fd16a32c438d522","revision":3,"first_index":0,"fingerprint":"f6-774e45ab36bcae1f","name":"Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.","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"],["6","7","2"],["24","46","29","6"],["120","326","329","146","24"],["720","2556","3604","2521","874","120"],["5040","22212","40564","39271","21244","6084","720"],["40320","212976","479996","598116","444849","197380","48348","5040"],["362880","2239344","6023772","9223012","8788569","5335212","2014172","432144","40320"],["3628800","25659360","80391816","146444068","170892798","132449241","68158628","22448988","4292496","362880"],["39916800","318540960","1140903576","2414802908","3344261458","3165869631","2074237318","928525148","271707336","46916640","3628800"],["479001600","4261576320","17194793472","41527574232","66693969484","74777311610","59715413757","33958912274","13474264660","3551780376","559628640","39916800"],["6227020800","61148511360","274671230976","746195986680","1365352494076","1772432684738","1673628118161","1158050824646","582672387868","207864320808","49896536832","7234462080","479001600"],["87178291200","937030429440","4640327881344","14017469816208","28815482743904","42563640009320","46472418555848","37969877081137","23212074150550","10484841533596","3400787686152","749937447936","100754029440","6227020800"],["1307674368000","15275952518400","82723344232320","275226637581936","628476818585472","1041871358554456","1292977238468200","1220162015998927","879759391394168","482241661111640","197799596762624","58860089325168","12010434712704","1503961724160","87178291200"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","15","105","945","10395","135135","2027025","34459425","654729075","13749310575","316234143225","7905853580625","213458046676875","6190283353629375"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A059364","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158761,"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-50fc3242d79d4e9a"]},{"id":158762,"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-50fc3242d79d4e9a","e-8e142d34c9c1ef70","e-b8821d58f365ef74","e-bf95690978550a83"]},{"id":158763,"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-50fc3242d79d4e9a","e-8e142d34c9c1ef70","e-b8821d58f365ef74","e-bf95690978550a83"]},{"id":158764,"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-50fc3242d79d4e9a"]},{"id":158765,"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-b8821d58f365ef74","e-bf95690978550a83"]},{"id":158766,"position":5,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-8e142d34c9c1ef70","e-b8821d58f365ef74"]},{"id":158767,"position":6,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-8e142d34c9c1ef70"]}],"region_exact":{},"incoming_edges":[{"id":"e-b8821d58f365ef74","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-7fd16a32c438d522","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":"358a256590ca6f39ffc7ed52c34c013c40158c37ec37c05c0eda3d3cdd970cf2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-4d60c3dd8627c01d","role":"sequence","name":"Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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-bf95690978550a83","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-7fd16a32c438d522","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":"c4ba7b45d9ebd1389f4ff252a186983973807f6a95cd98e68cbe51e06fbf4ef7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-8e142d34c9c1ef70","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-7fd16a32c438d522","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"91731a9c18ce158a9299e749c3c5c22cd29d205bde442b696d58bdbfa7e2c8d6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-4d60c3dd8627c01d","role":"sequence","name":"Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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-50fc3242d79d4e9a","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-7fd16a32c438d522","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":"12ea5b1f20e3ceb5d81382530997ca1e2f07c07b62f6c5ff762e53d62dd685c5","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-23e30432bbaed1be","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-8401ba73e6a78cca","conclusion_name":"basis_map_A013609 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-3cc7d65fdc6c1ffd","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-629fc911ba71fa1d","conclusion_name":"basis_map_A013610 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-451612e307ad81d9","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-8742b407df6b9fe8","conclusion_name":"basis_map_A008277 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-5d9e378754634336","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-be7df2e3fd154f3c","conclusion_name":"basis_map_A013611 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-6e263990c3c1f7f9","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-6e1be0f1b7cdfa83","conclusion_name":"basis_map_A007318 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-bcc91de7315c2529","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-724a8c59bef8064e","conclusion_name":"obreschkoff_combination of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-bcc91de7315c2529","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-724a8c59bef8064e","conclusion_name":"obreschkoff_combination of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1."},{"id":"e-68dd2f09e1ded893","operation":"preserver_image","operation_detail":"affine, shift -1","conclusion_id":"n-a6c3537128a476c6","conclusion_name":"Triangle of Stirling numbers of first kind, s(n, n-k+1), n >= 1, 1 <= k <= n. Also triangle T(n,k) giving coefficients in expansion of n!*binomial(x,n)/x in powers of x."}],"used_by_total":8,"links":[{"id":"l-a2ba1374d988c596","kind":"fingerprint_related","node_a_id":"n-7fd16a32c438d522","node_b_id":"n-849de7332df28657","fingerprint":"f6-774e45ab36bcae1f","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-774e45ab36bcae1f"},"other_id":"n-849de7332df28657","other":{"id":"n-849de7332df28657","name":"Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.","first_index":0,"fingerprint":"f6-774e45ab36bcae1f","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["0","1"],["0","1","2"]],"card_rows":[["1"],["0","1"],["0","1","2"],["0","2","7","6"]],"row_sums_preview":["1","1","3","15","105","945","10395","135135"],"regions":["(-inf, 0]","[-1, 0]"],"region_exact":{},"oeis_ids":["A088996"],"derivation":{"root":"n-849de7332df28657","steps":[],"edges":[],"text":"A088996"},"headline":"A088996: Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.","chain":null}},{"id":"l-a323c6014a1e845c","kind":"fingerprint_related","node_a_id":"n-7fd16a32c438d522","node_b_id":"n-5051121a22eaf16b","fingerprint":"f6-774e45ab36bcae1f","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-774e45ab36bcae1f"},"other_id":"n-5051121a22eaf16b","other":{"id":"n-5051121a22eaf16b","name":"mobius_x_over_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","first_index":0,"fingerprint":"f6-774e45ab36bcae1f","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","2"],["2","7","6"]],"card_rows":[["1"],["1","2"],["2","7","6"],["6","29","46","24"]],"row_sums_preview":["1","3","15","105","945","10395","135135","2027025"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-efe23a76953cf69d","steps":["x \u21a6 x/(x+1)"],"edges":["e-034d7e75529eb2bf"],"text":"A130534 \u2192 x \u21a6 x/(x+1)"},"headline":"A130534 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-111770b63392e08e","kind":"oeis_match","node_a_id":"n-7fd16a32c438d522","node_b_id":null,"fingerprint":null,"oeis_id":"A001147","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001147","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c981dd458c069222","kind":"oeis_match","node_a_id":"n-7fd16a32c438d522","node_b_id":null,"fingerprint":null,"oeis_id":"A059364","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":41},"in_catalog":true,"oeis_id":"A059364","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A059364","relation":"identification"},{"oeis_id":"A001147","relation":"match_row_sums"},{"oeis_id":"A059364","relation":"match_triangle"}],"bfiles":[{"node_id":"n-7fd16a32c438d522","oeis_id":"A059364","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":41,"oeis_terms_agreeing":41,"oeis_terms_available":41,"term_count":990,"raw_size":42441}],"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:       6,        7,        2;\n  3:      24,       46,       29,         6;\n  4:     120,      326,      329,       146,        24;\n  5:     720,     2556,     3604,      2521,       874,       120;\n  6:    5040,    22212,    40564,     39271,     21244,      6084,      720;\n  7:   40320,   212976,   479996,    598116,    444849,    197380,    48348,     5040;\n  8:  362880,  2239344,  6023772,   9223012,   8788569,   5335212,  2014172,   432144,   40320;\n  9: 3628800, 25659360, 80391816, 146444068, 170892798, 132449241, 68158628, 22448988, 4292496, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n+1+n*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[(n + 1 + n*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] = (n + 1 + n*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":"A059364","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:       2,        1;\n   3:       6,        7,        2;\n   4:      24,       46,       29,         6;\n   5:     120,      326,      329,       146,        24;\n   6:     720,     2556,     3604,      2521,       874,       120;\n   7:    5040,    22212,    40564,     39271,     21244,      6084,      720;\n   8:   40320,   212976,   479996,    598116,    444849,    197380,    48348,     5040;\n   9:  362880,  2239344,  6023772,   9223012,   8788569,   5335212,  2014172,   432144,   40320;\n  10: 3628800, 25659360, 80391816, 146444068, 170892798, 132449241, 68158628, 22448988, 4292496, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n+(n-1)*x)*P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(n + (n - 1)*x)*P[n - 1, 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] = (n + (n - 1)*x)*v[i - 1]); 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-7fd16a32c438d522","steps":[],"edges":[],"text":"A059364"},"headline":"A059364: Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.","chain":null}