{"id":"n-d55979c30b97975a","revision":1,"first_index":0,"fingerprint":"f6-8fea465cea2922a0","name":"Triangular array A066667 or A008297 unsigned and transposed.","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":false,"rows":[["1"],["1","2"],["1","6","6"],["1","12","36","24"],["1","20","120","240","120"],["1","30","300","1200","1800","720"],["1","42","630","4200","12600","15120","5040"],["1","56","1176","11760","58800","141120","141120","40320"],["1","72","2016","28224","211680","846720","1693440","1451520","362880"],["1","90","3240","60480","635040","3810240","12700800","21772800","16329600","3628800"],["1","110","4950","118800","1663200","13970880","69854400","199584000","299376000","199584000","39916800"],["1","132","7260","217800","3920400","43908480","307359360","1317254400","3293136000","4390848000","2634508800","479001600"],["1","156","10296","377520","8494200","122316480","1141620480","6849722880","25686460800","57081024000","68497228800","37362124800","6227020800"],["1","182","14196","624624","17177160","309188880","3710266560","29682132480","155831195520","519437318400","1038874636800","1133317785600","566658892800","87178291200"],["1","210","19110","993720","32792760","721440720","10821610800","111307996800","779155977600","3636061228800","10908183686400","19833061248000","19833061248000","9153720576000","1307674368000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","13","73","501","4051","37633","394353","4596553","58941091","824073141","12470162233","202976401213","3535017524403","65573803186921"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A089231","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158963,"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-db00758dc4aca02d"]},{"id":158964,"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-db00758dc4aca02d"]},{"id":158965,"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-db00758dc4aca02d"]},{"id":158966,"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-db00758dc4aca02d"]}],"region_exact":{},"incoming_edges":[{"id":"e-db00758dc4aca02d","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-d55979c30b97975a","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":"99da08165dcbfbad9a5895eb32bb2bc469449357ff953a47c30f0e41278e4654","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-a32213ca02c6584d","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-69c5ad82a7bc1667","conclusion_name":"obreschkoff_combination of Triangular array A066667 or A008297 unsigned and transposed."},{"id":"e-a32213ca02c6584d","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-69c5ad82a7bc1667","conclusion_name":"obreschkoff_combination of Triangular array A066667 or A008297 unsigned and transposed."},{"id":"e-cee0a9f908e74de4","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-eb51f16fedb3c293","conclusion_name":"Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1."}],"used_by_total":3,"links":[{"id":"l-f41282cea48376c5","kind":"fingerprint_related","node_a_id":"n-d55979c30b97975a","node_b_id":"n-011d67b73ad91983","fingerprint":"f6-8fea465cea2922a0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8fea465cea2922a0"},"other_id":"n-011d67b73ad91983","other":{"id":"n-011d67b73ad91983","name":"basis_map_A008277 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-8fea465cea2922a0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["6","6","1"]],"card_rows":[["1"],["2","1"],["6","6","1"],["24","36","12","1"]],"row_sums_preview":["1","3","13","73","501","4051","37633","394353"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-efe23a76953cf69d","steps":["basis A008277"],"edges":["e-31e8b29857f291e5"],"text":"A130534 \u2192 basis A008277"},"headline":"A130534 \u2192 basis A008277","chain":null}},{"id":"l-a318402dcc7b1261","kind":"oeis_match","node_a_id":"n-d55979c30b97975a","node_b_id":null,"fingerprint":null,"oeis_id":"A089231","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":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A089231","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-d26b6f0f87b5f3aa","kind":"oeis_match","node_a_id":"n-d55979c30b97975a","node_b_id":null,"fingerprint":null,"oeis_id":"A105278","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":47},"in_catalog":true,"oeis_id":"A105278","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e4d360ff9d04709f","kind":"oeis_match","node_a_id":"n-d55979c30b97975a","node_b_id":null,"fingerprint":null,"oeis_id":"A000262","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":"A000262","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A089231","relation":"identification"},{"oeis_id":"A105278","relation":"match_reversed_triangle"},{"oeis_id":"A000262","relation":"match_row_sums"},{"oeis_id":"A089231","relation":"match_triangle"}],"bfiles":[{"node_id":"n-d55979c30b97975a","oeis_id":"A089231","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":29235},{"node_id":"n-d55979c30b97975a","oeis_id":"A105278","target":"reversed_triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":47,"oeis_terms_agreeing":47,"oeis_terms_available":47,"term_count":990,"raw_size":29235}],"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,  2;\n  2: 1,  6,    6;\n  3: 1, 12,   36,    24;\n  4: 1, 20,  120,   240,    120;\n  5: 1, 30,  300,  1200,   1800,     720;\n  6: 1, 42,  630,  4200,  12600,   15120,     5040;\n  7: 1, 56, 1176, 11760,  58800,  141120,   141120,    40320;\n  8: 1, 72, 2016, 28224, 211680,  846720,  1693440,  1451520,   362880;\n  9: 1, 90, 3240, 60480, 635040, 3810240, 12700800, 21772800, 16329600, 3628800;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+2*n*x)*P(n-1,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^2*D[P[n - 1, x], 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] = (1 + 2*n*x)*v[i - 1] - 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 - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A089231","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: 1,  2;\n   3: 1,  6,    6;\n   4: 1, 12,   36,    24;\n   5: 1, 20,  120,   240,    120;\n   6: 1, 30,  300,  1200,   1800,     720;\n   7: 1, 42,  630,  4200,  12600,   15120,     5040;\n   8: 1, 56, 1176, 11760,  58800,  141120,   141120,    40320;\n   9: 1, 72, 2016, 28224, 211680,  846720,  1693440,  1451520,   362880;\n  10: 1, 90, 3240, 60480, 635040, 3810240, 12700800, 21772800, 16329600, 3628800;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(2*n-2)*x)*P(n-1,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^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^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":0,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A105278","target":"reversed_triangle","first_row":0,"oeis_offset":1,"reversed":true,"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,        6,        1;\n   4:      24,       36,       12,        1;\n   5:     120,      240,      120,       20,       1;\n   6:     720,     1800,     1200,      300,      30,      1;\n   7:    5040,    15120,    12600,     4200,     630,     42,     1;\n   8:   40320,   141120,   141120,    58800,   11760,   1176,    56,    1;\n   9:  362880,  1451520,  1693440,   846720,  211680,  28224,  2016,   72,  1;\n  10: 3628800, 16329600, 21772800, 12700800, 3810240, 635040, 60480, 3240, 90, 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-2)*x)*P(n-1,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^2*D[P[n - 1, x], x]];\nTable[Reverse[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^2*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c = Vecrev(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":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-d55979c30b97975a","steps":[],"edges":[],"text":"A089231"},"headline":"A089231: Triangular array A066667 or A008297 unsigned and transposed.","chain":null}
