{"id":"n-5576233c61c40153","revision":0,"first_index":0,"fingerprint":"f6-aa2cb32670ed1336","name":"Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","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"],["0","2"],["0","1","4"],["0","0","6","8"],["0","0","1","24","16"],["0","0","0","10","80","32"],["0","0","0","1","60","240","64"],["0","0","0","0","14","280","672","128"],["0","0","0","0","1","112","1120","1792","256"],["0","0","0","0","0","18","672","4032","4608","512"],["0","0","0","0","0","1","180","3360","13440","11520","1024"],["0","0","0","0","0","0","22","1320","14784","42240","28160","2048"],["0","0","0","0","0","0","1","264","7920","59136","126720","67584","4096"],["0","0","0","0","0","0","0","26","2288","41184","219648","366080","159744","8192"],["0","0","0","0","0","0","0","1","364","16016","192192","768768","1025024","372736","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","5","14","41","122","365","1094","3281","9842","29525","88574","265721","797162","2391485"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A372873","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169833,"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":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-9b820444cb22b76a"]},{"id":169834,"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-9b820444cb22b76a"]},{"id":169835,"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-9b820444cb22b76a"]}],"region_exact":{},"incoming_edges":[{"id":"e-9b820444cb22b76a","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-5576233c61c40153","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":null,"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"certificate_hash":"e6690cfb915ebf51c1fb1f06d44cc83d26a09edaa613631bba018702507d015d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-d4528680e031f1cd","kind":"fingerprint_related","node_a_id":"n-b6912a345c4fb865","node_b_id":"n-5576233c61c40153","fingerprint":"f6-aa2cb32670ed1336","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-aa2cb32670ed1336"},"other_id":"n-b6912a345c4fb865","other":{"id":"n-b6912a345c4fb865","name":"veronese_section_2_0 of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-aa2cb32670ed1336","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2"],["4","1"]],"card_rows":[["1"],["2"],["4","1"],["8","6"]],"row_sums_preview":["1","2","5","14","41","122","365","1094"],"regions":["(-inf, 0]","(-inf, 0)"],"region_exact":{},"oeis_ids":["A372868"],"derivation":{"root":"n-b6912a345c4fb865","steps":[],"edges":[],"text":"A372868"},"headline":"A372868: veronese_section_2_0 of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","chain":null}},{"id":"l-d8999cc85c7c1c1e","kind":"fingerprint_related","node_a_id":"n-7cb419d84bd12a57","node_b_id":"n-5576233c61c40153","fingerprint":"f6-aa2cb32670ed1336","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-aa2cb32670ed1336"},"other_id":"n-7cb419d84bd12a57","other":{"id":"n-7cb419d84bd12a57","name":"veronese_section_2_0 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","first_index":0,"fingerprint":"f6-aa2cb32670ed1336","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["3"],["6"],["12","3"]],"card_rows":[["3"],["6"],["12","3"],["24","18"]],"row_sums_preview":["3","6","15","42","123","366","1095","3282"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-51b4f5e7901c2b50","steps":["Veronese 2"],"edges":["e-74cdb64b6d1e6b98"],"text":"A120910 \u2192 Veronese 2"},"headline":"A120910 \u2192 Veronese 2","chain":null}},{"id":"l-0203d6959e801b21","kind":"oeis_match","node_a_id":"n-5576233c61c40153","node_b_id":null,"fingerprint":null,"oeis_id":"A124302","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":"A124302","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-8a984bdde7f2f7fa","kind":"oeis_match","node_a_id":"n-5576233c61c40153","node_b_id":null,"fingerprint":null,"oeis_id":"A372873","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A372873","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-cc7038903d660435","kind":"oeis_match","node_a_id":"n-5576233c61c40153","node_b_id":null,"fingerprint":null,"oeis_id":"A007051","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":"A007051","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f4d1259349d17741","kind":"oeis_match","node_a_id":"n-5576233c61c40153","node_b_id":null,"fingerprint":null,"oeis_id":"A372868","in_catalog":1,"target":"reversed_triangle","row_alignment":"node_lengths","rows_matched":14,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":true,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":14,"target":"reversed_triangle","terms_compared":56},"in_catalog":true,"oeis_id":"A372868","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A372873","relation":"identification"},{"oeis_id":"A372868","relation":"match_reversed_triangle"},{"oeis_id":"A007051","relation":"match_row_sums"},{"oeis_id":"A124302","relation":"match_row_sums"},{"oeis_id":"A372873","relation":"match_triangle"}],"bfiles":[{"node_id":"n-5576233c61c40153","oeis_id":"A007051","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":29,"oeis_terms_available":29,"term_count":200,"raw_size":10425},{"node_id":"n-5576233c61c40153","oeis_id":"A372868","target":"reversed_triangle","oeis_offset":1,"first_row":0,"rows_used":62,"terms_matched":56,"oeis_terms_agreeing":56,"oeis_terms_available":56,"term_count":992,"raw_size":19161},{"node_id":"n-5576233c61c40153","oeis_id":"A372873","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":10438}],"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: 0, 2;\n  2: 0, 1, 4;\n  3: 0, 0, 6,  8;\n  4: 0, 0, 1, 24, 16;\n  5: 0, 0, 0, 10, 80,  32;\n  6: 0, 0, 0,  1, 60, 240,   64;\n  7: 0, 0, 0,  0, 14, 280,  672,  128;\n  8: 0, 0, 0,  0,  1, 112, 1120, 1792,  256;\n  9: 0, 0, 0,  0,  0,  18,  672, 4032, 4608, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 4*x*P(n-1,x) + (x-4*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[4*x*P[n - 1, x] + (x - 4*x^2)*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] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = 4*x*v[i - 1] + (x - 4*x^2)*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":"A372868","target":"reversed_triangle","first_row":0,"oeis_offset":1,"reversed":true,"trim_zeros":"low","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:   1;\n   2:   2;\n   3:   4,    1;\n   4:   8,    6;\n   5:  16,   24,    1;\n   6:  32,   80,   10;\n   7:  64,  240,   60,   1;\n   8: 128,  672,  280,  14;\n   9: 256, 1792, 1120, 112,  1;\n  10: 512, 4608, 4032, 672, 18;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, down to the lowest nonzero coefficient, where P(n,x) = 4*x*P(n-1,x) + (x-4*x^2)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[4*x*P[n - 1, x] + (x - 4*x^2)*P[n - 2, x]];\nTable[Reverse[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x]], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2*x; for(n = 3, N, my(i = n); v[i] = 4*x*v[i - 1] + (x - 4*x^2)*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); 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":"low","regular_triangle":false}},{"oeis_id":"A372873","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: 0, 2;\n   3: 0, 1, 4;\n   4: 0, 0, 6,  8;\n   5: 0, 0, 1, 24, 16;\n   6: 0, 0, 0, 10, 80,  32;\n   7: 0, 0, 0,  1, 60, 240,   64;\n   8: 0, 0, 0,  0, 14, 280,  672,  128;\n   9: 0, 0, 0,  0,  1, 112, 1120, 1792,  256;\n  10: 0, 0, 0,  0,  0,  18,  672, 4032, 4608, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 4*x*P(n-1,x) + (x-4*x^2)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[4*x*P[n - 1, x] + (x - 4*x^2)*P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2*x; for(n = 3, N, my(i = n); v[i] = 4*x*v[i - 1] + (x - 4*x^2)*v[i - 2]); 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-5576233c61c40153","steps":[],"edges":[],"text":"A372873"},"headline":"A372873: Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","chain":null}