{"id":"n-a6f3b35778192ffb","revision":1,"first_index":0,"fingerprint":"f6-90ff47d73675b1af","name":"Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).","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","3","1"],["1","6","6","1"],["1","10","19","10","1"],["1","15","45","45","15","1"],["1","21","90","141","90","21","1"],["1","28","161","357","357","161","28","1"],["1","36","266","784","1107","784","266","36","1"],["1","45","414","1554","2907","2907","1554","414","45","1"],["1","55","615","2850","6765","8953","6765","2850","615","55","1"],["1","66","880","4917","14355","24068","24068","14355","4917","880","66","1"],["1","78","1221","8074","28314","58278","73789","58278","28314","8074","1221","78","1"],["1","91","1651","12727","52624","129844","201643","201643","129844","52624","12727","1651","91","1"],["1","105","2184","19383","93093","270270","502593","616227","502593","270270","93093","19383","2184","105","1"]],"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:A056241","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-1","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:reversal","source_kind":"derived","equality_edge_id":"e-d32fa4f50d269032","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["2"]]},"terms":[{"coeff":{"coeffs":[["-2","0","-6"],["2","-1","10"],["0","1","-4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","-6","-14"],["0","0","4","8"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4","-4","-4"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169167,"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-75dce0367cd5d698"]},{"id":169168,"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-22bf24bbb6b1c2a7","e-75dce0367cd5d698"]},{"id":169169,"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-22bf24bbb6b1c2a7","e-75dce0367cd5d698"]},{"id":169170,"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-75dce0367cd5d698"]},{"id":170763,"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-22bf24bbb6b1c2a7"]}],"region_exact":{},"incoming_edges":[{"id":"e-d32fa4f50d269032","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-a6f3b35778192ffb","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"8e28b77a778dd63f732cfb8f5b3cfe75c42a3c328e3a0e846f27ec3b01851e51","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-22bf24bbb6b1c2a7","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-a6f3b35778192ffb","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":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"fe90f55b0fba2b6b29ce867d25f22bb83ec01c15894749b52b8bc179fa87124c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-a6f3b35778192ffb","role":"sequence","name":"Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).","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-75dce0367cd5d698","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-a6f3b35778192ffb","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":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"24d3d66ae4932ae9b6e5f3e582961d6403e98ff7910b7437f3e559326bb3cca6","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-2782dc1aefe773f5","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-f61e14215f72611a","conclusion_name":"shift_x_plus_one of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-419b86e0342da3cd","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-2d23a1ca8e96d2ab","conclusion_name":"basis_map_A013609 of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-b2a33f5e9ab45e0c","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-a73bf794859ac224","conclusion_name":"basis_map_A008277 of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-f4298ff451e78d20","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-3c823179bb708635","conclusion_name":"basis_map_A013611 of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-f955fdd3a815ec3d","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-dc8f9b0d78276a3e","conclusion_name":"basis_map_A013610 of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-22bf24bbb6b1c2a7","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-a6f3b35778192ffb","conclusion_name":"Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-9c896b6e10f8a55d","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-6fc152d0d54e7bb8","conclusion_name":"theta_plus_one_squared of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-bb559b3f89099a24","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-46287fb5b5b8ec61","conclusion_name":"theta_plus_one of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-bbca96cd0c51f8a9","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-a25201101abbced1","conclusion_name":"mobius_x_over_x_plus_one of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-c85d15f6d3b231a4","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-f61e14215f72611a","conclusion_name":"shift_x_plus_one of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-e14774b67d812849","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-07a074fde62a4797","conclusion_name":"derivative of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."},{"id":"e-f5467c80bb90d43f","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-c14d9c29051f3e6c","conclusion_name":"one_plus_derivative of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n)."}],"used_by_total":12,"links":[{"id":"l-2987c1fc93cf2c06","kind":"oeis_match","node_a_id":"n-a6f3b35778192ffb","node_b_id":null,"fingerprint":null,"oeis_id":"A056241","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":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":65},"in_catalog":true,"oeis_id":"A056241","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-3886a71500705f06","kind":"oeis_match","node_a_id":"n-a6f3b35778192ffb","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-c428ec39cc6facfe","kind":"oeis_match","node_a_id":"n-a6f3b35778192ffb","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-e19d27a2ae6caf6b","kind":"oeis_match","node_a_id":"n-a6f3b35778192ffb","node_b_id":null,"fingerprint":null,"oeis_id":"A056241","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":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":65},"in_catalog":true,"oeis_id":"A056241","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A056241","relation":"identification"},{"oeis_id":"A056241","relation":"match_reversed_triangle"},{"oeis_id":"A007051","relation":"match_row_sums"},{"oeis_id":"A124302","relation":"match_row_sums"},{"oeis_id":"A056241","relation":"match_triangle"}],"bfiles":[{"node_id":"n-a6f3b35778192ffb","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-a6f3b35778192ffb","oeis_id":"A056241","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":65,"oeis_terms_agreeing":65,"oeis_terms_available":65,"term_count":990,"raw_size":14073},{"node_id":"n-a6f3b35778192ffb","oeis_id":"A056241","target":"reversed_triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":65,"oeis_terms_agreeing":65,"oeis_terms_available":65,"term_count":990,"raw_size":14073}],"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,  3,   1;\n  3: 1,  6,   6,    1;\n  4: 1, 10,  19,   10,    1;\n  5: 1, 15,  45,   45,   15,    1;\n  6: 1, 21,  90,  141,   90,   21,    1;\n  7: 1, 28, 161,  357,  357,  161,   28,   1;\n  8: 1, 36, 266,  784, 1107,  784,  266,  36,  1;\n  9: 1, 45, 414, 1554, 2907, 2907, 1554, 414, 45, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - (1+x+x^2)*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[(2 + 2*x)*P[n - 1, x] - (1 + x + 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] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 1] - (1 + x + 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":"A056241","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,  1;\n   3: 1,  3,   1;\n   4: 1,  6,   6,    1;\n   5: 1, 10,  19,   10,    1;\n   6: 1, 15,  45,   45,   15,    1;\n   7: 1, 21,  90,  141,   90,   21,    1;\n   8: 1, 28, 161,  357,  357,  161,   28,   1;\n   9: 1, 36, 266,  784, 1107,  784,  266,  36,  1;\n  10: 1, 45, 414, 1554, 2907, 2907, 1554, 414, 45, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - (1+x+x^2)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 + x + 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] = 1 + x; for(n = 3, N, my(i = n); v[i] = (2 + 2*x)*v[i - 1] - (1 + x + 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}},{"oeis_id":"A056241","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: 1,  1;\n   3: 1,  3,   1;\n   4: 1,  6,   6,    1;\n   5: 1, 10,  19,   10,    1;\n   6: 1, 15,  45,   45,   15,    1;\n   7: 1, 21,  90,  141,   90,   21,    1;\n   8: 1, 28, 161,  357,  357,  161,   28,   1;\n   9: 1, 36, 266,  784, 1107,  784,  266,  36,  1;\n  10: 1, 45, 414, 1554, 2907, 2907, 1554, 414, 45, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (2+2*x)*P(n-1,x) - (1+x+x^2)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 + x + x^2)*P[n - 2, x]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n]], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + x; for(n = 3, N, my(i = n); v[i] = (2 + 2*x)*v[i - 1] - (1 + x + x^2)*v[i - 2]); 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-a6f3b35778192ffb","steps":[],"edges":[],"text":"A056241"},"headline":"A056241: Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).","chain":null}