{"id":"n-8c29b5d8d22f0df0","revision":1,"first_index":0,"fingerprint":"f6-25ae7209f5b9964f","name":"Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","1"],["1","8","1"],["1","19","19","1"],["1","35","158","35","1"],["1","57","592","592","57","1"],["1","86","1629","5608","1629","86","1"],["1","123","3767","28549","28549","3767","123","1"],["1","169","7760","105621","309458","105621","7760","169","1"],["1","225","14694","320566","1985274","1985274","320566","14694","225","1"],["1","292","26073","847420","9276826","24394776","9276826","847420","26073","292","1"],["1","371","43915","2019625","35128394","188522974","188522974","35128394","2019625","43915","371","1"],["1","463","70858","4436183","114263239","1067842534","2596970564","1067842534","114263239","4436183","70858","463","1"],["1","569","110276","9118116","330760047","4870587143","23459725368","23459725368","4870587143","330760047","9118116","110276","569","1"],["1","690","166405","17731352","872220123","18912935870","156471416591","358555918416","156471416591","18912935870","872220123","17731352","166405","690","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","10","40","230","1300","9040","64880","536560","4641520","44696000","451430560","4970197120","57340603040","711104860480"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A154227","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"],["0","3/2"],["0","1/2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159429,"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-f727ccd9a8e875c3"]},{"id":159430,"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-f727ccd9a8e875c3"]},{"id":159431,"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-f727ccd9a8e875c3"]},{"id":159432,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-f727ccd9a8e875c3"]}],"region_exact":{},"incoming_edges":[{"id":"e-f727ccd9a8e875c3","operation":{"operation":"theorem_check","theorem":"liu_wang_derivative_lag"},"operation_detail":"liu_wang_derivative_lag","conclusion_id":"n-8c29b5d8d22f0df0","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 the interlacers f' and the lag row (strict form, as in the derivative-lag theorems of the RealRooted library, https://github.com/PerAlexandersson/RealRooted), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_nonnegCoeffs","RealRooted.LiuWang.strictInterl_nonpos_lag_sequence"],"certificate_hash":"2ef511d883e8cda855bf3376a3986b0306a240d3294bfec965bd6213605cf35a","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":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0a5c12d47b8633af","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-6b17131842b3d344","conclusion_name":"basis_map_A013609 of Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows."},{"id":"e-b5dc17a8258cc344","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-a9c55a824264d0f7","conclusion_name":"basis_map_A007318 of Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows."},{"id":"e-d61a33ddedddac02","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-f31ac0aa03765fb6","conclusion_name":"basis_map_A008277 of Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows."},{"id":"e-ec960ca5c6c41875","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-e7adaceeb185bd5d","conclusion_name":"basis_map_A013610 of Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows."},{"id":"e-ffc728039c7db246","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-61b5a47b104de16c","conclusion_name":"basis_map_A013611 of Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows."},{"id":"e-d9f36f8327a29756","operation":"gamma_polynomial","operation_detail":"scale 1, shift 0","conclusion_id":"n-49b1e1a9ee8d486a","conclusion_name":"gamma_polynomial of Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows."}],"used_by_total":6,"links":[{"id":"l-1f995582ef094c0f","kind":"oeis_match","node_a_id":"n-8c29b5d8d22f0df0","node_b_id":null,"fingerprint":null,"oeis_id":"A154227","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A154227","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-87a5b58f2fa43ce2","kind":"oeis_match","node_a_id":"n-8c29b5d8d22f0df0","node_b_id":null,"fingerprint":null,"oeis_id":"A154227","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A154227","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A154227","relation":"identification"},{"oeis_id":"A154227","relation":"match_reversed_triangle"},{"oeis_id":"A154227","relation":"match_triangle"}],"bfiles":[{"node_id":"n-8c29b5d8d22f0df0","oeis_id":"A154227","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":23835},{"node_id":"n-8c29b5d8d22f0df0","oeis_id":"A154227","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":23835}],"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,   1;\n  2: 1,   8,     1;\n  3: 1,  19,    19,      1;\n  4: 1,  35,   158,     35,       1;\n  5: 1,  57,   592,    592,      57,       1;\n  6: 1,  86,  1629,   5608,    1629,      86,      1;\n  7: 1, 123,  3767,  28549,   28549,    3767,    123,     1;\n  8: 1, 169,  7760, 105621,  309458,  105621,   7760,   169,   1;\n  9: 1, 225, 14694, 320566, 1985274, 1985274, 320566, 14694, 225, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + ((1/2)*n^2+(3/2)*n+1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + ((1/2)*n^2 + (3/2)*n + 1)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + ((1/2)*n^2 + (3/2)*n + 1)*x*v[i - 2]); 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":"A154227","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: 1,   1;\n  2: 1,   8,     1;\n  3: 1,  19,    19,      1;\n  4: 1,  35,   158,     35,       1;\n  5: 1,  57,   592,    592,      57,       1;\n  6: 1,  86,  1629,   5608,    1629,      86,      1;\n  7: 1, 123,  3767,  28549,   28549,    3767,    123,     1;\n  8: 1, 169,  7760, 105621,  309458,  105621,   7760,   169,   1;\n  9: 1, 225, 14694, 320566, 1985274, 1985274, 320566, 14694, 225, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + ((1/2)*n^2+(3/2)*n+1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + ((1/2)*n^2 + (3/2)*n + 1)*x*P[n - 2, 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; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + ((1/2)*n^2 + (3/2)*n + 1)*x*v[i - 2]); 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}},{"oeis_id":"A154227","target":"reversed_triangle","first_row":0,"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: 1,   1;\n  2: 1,   8,     1;\n  3: 1,  19,    19,      1;\n  4: 1,  35,   158,     35,       1;\n  5: 1,  57,   592,    592,      57,       1;\n  6: 1,  86,  1629,   5608,    1629,      86,      1;\n  7: 1, 123,  3767,  28549,   28549,    3767,    123,     1;\n  8: 1, 169,  7760, 105621,  309458,  105621,   7760,   169,   1;\n  9: 1, 225, 14694, 320566, 1985274, 1985274, 320566, 14694, 225, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+x)*P(n-1,x) + ((1/2)*n^2+(3/2)*n+1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + ((1/2)*n^2 + (3/2)*n + 1)*x*P[n - 2, 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; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + ((1/2)*n^2 + (3/2)*n + 1)*x*v[i - 2]); 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":0,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-8c29b5d8d22f0df0","steps":[],"edges":[],"text":"A154227"},"headline":"A154227: Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows.","chain":null}