{"id":"n-e2f0f447a502f269","revision":1,"first_index":1,"fingerprint":"f6-36df5d4b0f5901bf","name":"Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","2"],["1","8","6"],["1","22","58","24"],["1","52","328","444","120"],["1","114","1452","4400","3708","720"],["1","240","5610","32120","58140","33984","5040"],["1","494","19950","195800","644020","785304","341136","40320"],["1","1004","67260","1062500","5765500","12440064","11026296","3733920","362880"],["1","2026","218848","5326160","44765000","155357384","238904904","162186912","44339040","3628800"],["1","4072","695038","25243904","314369720","1648384304","4002695088","4642163952","2507481216","568356480","39916800"],["1","8166","2170626","114876376","2051482776","15548960784","56041398784","101180433024","92199790224","40788301824","7827719040","479001600"],["1","16356","6699696","507259276","12669817776","134323420224","687720046384","1818188642304","2549865473424","1883079661824","697929436800","115336085760","6227020800"],["1","32738","20507988","2189829808","75016052228","1084676512416","7634832149392","28299910066112","57494373464592","64728375139872","39689578055808","12550904017920","1810992556800","87178291200"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","3","15","105","945","10395","135135","2027025","34459425","654729075","13749310575","316234143225","7905853580625","213458046676875"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A201637","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","-4"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159576,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0)","region_exact":null,"edges":["e-d7adf0401ce51e02"]},{"id":159577,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-d7adf0401ce51e02"]},{"id":159578,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-d7adf0401ce51e02"]},{"id":159579,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-d7adf0401ce51e02"]}],"region_exact":{},"incoming_edges":[{"id":"e-d7adf0401ce51e02","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-e2f0f447a502f269","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":"306f089010964b55efde651b9941883f3e1960edef822e65f7e1f26191f52800","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-ecc7f59b5400851a","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-55e6206734b15203","conclusion_name":"obreschkoff_combination of Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows."},{"id":"e-ecc7f59b5400851a","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-55e6206734b15203","conclusion_name":"obreschkoff_combination of Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows."},{"id":"e-e86572942f776a07","operation":"preserver_image","operation_detail":"reversal, shift 1","conclusion_id":"n-387e148a64b95986","conclusion_name":"Row reversed version of triangle A201637 (second-order Eulerian triangle)."}],"used_by_total":3,"links":[{"id":"l-3ddf5d451edcb6a7","kind":"fingerprint_related","node_a_id":"n-e14e37227fef094e","node_b_id":"n-e2f0f447a502f269","fingerprint":"f6-36df5d4b0f5901bf","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-36df5d4b0f5901bf"},"other_id":"n-e14e37227fef094e","other":{"id":"n-e14e37227fef094e","name":"Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)).","first_index":0,"fingerprint":"f6-36df5d4b0f5901bf","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","1"]],"card_rows":[["1"],["1"],["2","1"],["6","8","1"]],"row_sums_preview":["1","1","3","15","105","945","10395","135135"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":["A163936"],"derivation":{"root":"n-e14e37227fef094e","steps":[],"edges":[],"text":"A163936"},"headline":"A163936: Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)).","chain":null}},{"id":"l-66bc972a34e73e8b","kind":"fingerprint_related","node_a_id":"n-9b757b008ff4762d","node_b_id":"n-e2f0f447a502f269","fingerprint":"f6-36df5d4b0f5901bf","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-36df5d4b0f5901bf"},"other_id":"n-9b757b008ff4762d","other":{"id":"n-9b757b008ff4762d","name":"Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.","first_index":0,"fingerprint":"f6-36df5d4b0f5901bf","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["6","8","1"]],"card_rows":[["1"],["2","1"],["6","8","1"],["24","58","22","1"]],"row_sums_preview":["1","3","15","105","945","10395","135135","2027025"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":["A112007"],"derivation":{"root":"n-9b757b008ff4762d","steps":[],"edges":[],"text":"A112007"},"headline":"A112007: Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.","chain":null}},{"id":"l-8dfb305919aa4026","kind":"fingerprint_related","node_a_id":"n-e2f0f447a502f269","node_b_id":"n-387e148a64b95986","fingerprint":"f6-36df5d4b0f5901bf","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-36df5d4b0f5901bf"},"other_id":"n-387e148a64b95986","other":{"id":"n-387e148a64b95986","name":"Row reversed version of triangle A201637 (second-order Eulerian triangle).","first_index":0,"fingerprint":"f6-36df5d4b0f5901bf","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","2","1"]],"card_rows":[["1"],["0","1"],["0","2","1"],["0","6","8","1"]],"row_sums_preview":["1","1","3","15","105","945","10395","135135"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A288874"],"derivation":{"root":"n-e2f0f447a502f269","steps":["reverse (shift +1)"],"edges":["e-e86572942f776a07"],"text":"A201637 \u2192 reverse (shift +1)"},"headline":"A288874: Row reversed version of triangle A201637 (second-order Eulerian triangle).","chain":"A201637 \u2192 reverse (shift +1)"}},{"id":"l-9233c1a9acb1ce5f","kind":"fingerprint_related","node_a_id":"n-d4c21302c908a2cf","node_b_id":"n-e2f0f447a502f269","fingerprint":"f6-36df5d4b0f5901bf","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-36df5d4b0f5901bf"},"other_id":"n-d4c21302c908a2cf","other":{"id":"n-d4c21302c908a2cf","name":"Second-order Eulerian triangle T(n,k), 1 <= k <= n.","first_index":0,"fingerprint":"f6-36df5d4b0f5901bf","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","8","6"]],"card_rows":[["1"],["1","2"],["1","8","6"],["1","22","58","24"]],"row_sums_preview":["1","3","15","105","945","10395","135135","2027025"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":["A008517"],"derivation":{"root":"n-d4c21302c908a2cf","steps":[],"edges":[],"text":"A008517"},"headline":"A008517: Second-order Eulerian triangle T(n,k), 1 <= k <= n.","chain":null}},{"id":"l-f4b3f0e1f97ad2ea","kind":"fingerprint_related","node_a_id":"n-e2f0f447a502f269","node_b_id":"n-2eda446fe9bdb6ec","fingerprint":"f6-36df5d4b0f5901bf","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-36df5d4b0f5901bf"},"other_id":"n-2eda446fe9bdb6ec","other":{"id":"n-2eda446fe9bdb6ec","name":"E2(n, k), the second-order Eulerian numbers with E2(0, k) = \u03b4_{0, k}. Triangle read by rows, E2(n, k) for 0 <= k <= n.","first_index":0,"fingerprint":"f6-36df5d4b0f5901bf","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","2"]],"card_rows":[["1"],["0","1"],["0","1","2"],["0","1","8","6"]],"row_sums_preview":["1","1","3","15","105","945","10395","135135"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A340556"],"derivation":{"root":"n-e14e37227fef094e","steps":["reverse"],"edges":["e-c8375d3b3fe52ed3"],"text":"A163936 \u2192 reverse"},"headline":"A340556: E2(n, k), the second-order Eulerian numbers with E2(0, k) = \u03b4_{0, k}. Triangle read by rows, E2(n, k) for 0 <= k <= n.","chain":"A163936 \u2192 reverse"}},{"id":"l-226e6ffc35384919","kind":"oeis_match","node_a_id":"n-e2f0f447a502f269","node_b_id":null,"fingerprint":null,"oeis_id":"A112007","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A112007","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-498e9bcf2192c2ae","kind":"oeis_match","node_a_id":"n-e2f0f447a502f269","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":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001147","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-781f958c257a8b03","kind":"oeis_match","node_a_id":"n-e2f0f447a502f269","node_b_id":null,"fingerprint":null,"oeis_id":"A008517","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A008517","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A201637","relation":"identification"},{"oeis_id":"A112007","relation":"match_reversed_triangle"},{"oeis_id":"A001147","relation":"match_row_sums"},{"oeis_id":"A008517","relation":"match_triangle"}],"bfiles":[{"node_id":"n-e2f0f447a502f269","oeis_id":"A001147","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":39820},{"node_id":"n-e2f0f447a502f269","oeis_id":"A008517","target":"triangle","oeis_offset":1,"first_row":2,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":37544},{"node_id":"n-e2f0f447a502f269","oeis_id":"A112007","target":"reversed_triangle","oeis_offset":0,"first_row":2,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":37542}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 1;\n   3: 1,    2;\n   4: 1,    8,     6;\n   5: 1,   22,    58,      24;\n   6: 1,   52,   328,     444,     120;\n   7: 1,  114,  1452,    4400,    3708,      720;\n   8: 1,  240,  5610,   32120,   58140,    33984,     5040;\n   9: 1,  494, 19950,  195800,  644020,   785304,   341136,   40320;\n  10: 1, 1004, 67260, 1062500, 5765500, 12440064, 11026296, 3733920, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(2*n-4)*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + (2*n - 4)*x)*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (2*n - 4)*x)*v[i - 1] + (x - x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A008517","target":"triangle","first_row":2,"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: 1,    2;\n   3: 1,    8,      6;\n   4: 1,   22,     58,      24;\n   5: 1,   52,    328,     444,      120;\n   6: 1,  114,   1452,    4400,     3708,       720;\n   7: 1,  240,   5610,   32120,    58140,     33984,      5040;\n   8: 1,  494,  19950,  195800,   644020,    785304,    341136,     40320;\n   9: 1, 1004,  67260, 1062500,  5765500,  12440064,  11026296,   3733920,   362880;\n  10: 1, 2026, 218848, 5326160, 44765000, 155357384, 238904904, 162186912, 44339040, 3628800;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(2*n-2)*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + (2*n - 2)*x)*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], 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] = (1 + (2*n - 2)*x)*v[i - 1] + (x - x^2)*deriv(v[i - 1], x)); 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":2,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A112007","target":"reversed_triangle","first_row":2,"oeis_offset":0,"reversed":true,"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:       6,        8,         1;\n  3:      24,       58,        22,         1;\n  4:     120,      444,       328,        52,         1;\n  5:     720,     3708,      4400,      1452,       114,        1;\n  6:    5040,    33984,     58140,     32120,      5610,      240,       1;\n  7:   40320,   341136,    785304,    644020,    195800,    19950,     494,      1;\n  8:  362880,  3733920,  11026296,  12440064,   5765500,  1062500,   67260,   1004,    1;\n  9: 3628800, 44339040, 162186912, 238904904, 155357384, 44765000, 5326160, 218848, 2026, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+2*n*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + 2*n*x)*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], x]];\nTable[Reverse[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] = (1 + 2*n*x)*v[i - 1] + (x - x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":2,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-e2f0f447a502f269","steps":[],"edges":[],"text":"A201637"},"headline":"A201637: Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.","chain":null}