{"id":"n-e9d97f6728dd613c","revision":0,"first_index":0,"fingerprint":"f6-30879770cb7d11f9","name":"Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1.","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","2","1"],["1","4","4","1"],["1","5","8","5","1"],["1","7","17","17","7","1"],["1","8","24","34","24","8","1"],["1","10","39","75","75","39","10","1"],["1","11","49","114","150","114","49","11","1"],["1","13","70","202","339","339","202","70","13","1"],["1","14","83","272","541","678","541","272","83","14","1"],["1","16","110","425","1015","1558","1558","1015","425","110","16","1"],["1","17","126","535","1440","2573","3116","2573","1440","535","126","17","1"],["1","19","159","771","2400","5028","7247","7247","5028","2400","771","159","19","1"],["1","20","178","930","3171","7428","12275","14494","12275","7428","3171","930","178","20","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","4","10","20","50","100","250","500","1250","2500","6250","12500","31250","62500"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A026386","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"],["1","2","1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2","-6","-2"],["1","3","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169958,"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-e01fac3a289a0ac0"]},{"id":169959,"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-e01fac3a289a0ac0"]},{"id":169960,"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-e01fac3a289a0ac0"]}],"region_exact":{},"incoming_edges":[{"id":"e-e01fac3a289a0ac0","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-e9d97f6728dd613c","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity; with lag L = 2, the induction runs in each residue class of n modulo L from its start row","lean_route":null,"lean_declarations":[],"certificate_hash":"4713c33c61cefd95d85c8e821d138e0e92be74af3d9f637a5e7a244b6b595110","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]}],"used_by":[{"id":"e-6a20535e8e523553","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-5597af3ddfbf73bc","conclusion_name":"basis_map_A007318 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1."},{"id":"e-963834c4f67cd977","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-578f86a1eed3200f","conclusion_name":"basis_map_A013610 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1."},{"id":"e-b8a9c3b9a3f30b0d","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-fc37a4c05f1f74d0","conclusion_name":"basis_map_A013609 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1."},{"id":"e-bd5f186e7642f06d","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-19abca205723952c","conclusion_name":"basis_map_A008277 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1."},{"id":"e-cd83dc6f666603f8","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-86d3a319b89ca52d","conclusion_name":"basis_map_A013611 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1."}],"used_by_total":5,"links":[{"id":"l-1e117a94eaff43d9","kind":"oeis_match","node_a_id":"n-e9d97f6728dd613c","node_b_id":null,"fingerprint":null,"oeis_id":"A026386","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":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":68},"in_catalog":true,"oeis_id":"A026386","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-4cea63c97679597a","kind":"oeis_match","node_a_id":"n-e9d97f6728dd613c","node_b_id":null,"fingerprint":null,"oeis_id":"A026386","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"reversed_triangle","terms_compared":68},"in_catalog":true,"oeis_id":"A026386","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f29042b2795e83a4","kind":"oeis_match","node_a_id":"n-e9d97f6728dd613c","node_b_id":null,"fingerprint":null,"oeis_id":"A026395","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":"A026395","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A026386","relation":"identification"},{"oeis_id":"A026386","relation":"match_reversed_triangle"},{"oeis_id":"A026395","relation":"match_row_sums"},{"oeis_id":"A026386","relation":"match_triangle"}],"bfiles":[{"node_id":"n-e9d97f6728dd613c","oeis_id":"A026386","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":68,"oeis_terms_agreeing":68,"oeis_terms_available":68,"term_count":990,"raw_size":11526},{"node_id":"n-e9d97f6728dd613c","oeis_id":"A026386","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":68,"oeis_terms_agreeing":68,"oeis_terms_available":68,"term_count":990,"raw_size":11526},{"node_id":"n-e9d97f6728dd613c","oeis_id":"A026395","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":30,"oeis_terms_available":30,"term_count":200,"raw_size":7933}],"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,  2,  1;\n  3: 1,  4,  4,   1;\n  4: 1,  5,  8,   5,   1;\n  5: 1,  7, 17,  17,   7,   1;\n  6: 1,  8, 24,  34,  24,   8,   1;\n  7: 1, 10, 39,  75,  75,  39,  10,  1;\n  8: 1, 11, 49, 114, 150, 114,  49, 11,  1;\n  9: 1, 13, 70, 202, 339, 339, 202, 70, 13, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x+(n-2)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[2, x_] := 1 + 2*x + x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*P[n - 2, x])/(n - 2)]];\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; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*v[i - 2])/(n - 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":"A026386","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,  2,  1;\n  3: 1,  4,  4,   1;\n  4: 1,  5,  8,   5,   1;\n  5: 1,  7, 17,  17,   7,   1;\n  6: 1,  8, 24,  34,  24,   8,   1;\n  7: 1, 10, 39,  75,  75,  39,  10,  1;\n  8: 1, 11, 49, 114, 150, 114,  49, 11,  1;\n  9: 1, 13, 70, 202, 339, 339, 202, 70, 13, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x+(n-2)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[2, x_] := 1 + 2*x + x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*P[n - 2, x])/(n - 2)]];\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; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*v[i - 2])/(n - 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":"A026386","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,  2,  1;\n  3: 1,  4,  4,   1;\n  4: 1,  5,  8,   5,   1;\n  5: 1,  7, 17,  17,   7,   1;\n  6: 1,  8, 24,  34,  24,   8,   1;\n  7: 1, 10, 39,  75,  75,  39,  10,  1;\n  8: 1, 11, 49, 114, 150, 114,  49, 11,  1;\n  9: 1, 13, 70, 202, 339, 339, 202, 70, 13, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (n-2)*P(n,x) = (n-2+(3*n-6)*x+(n-2)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[2, x_] := 1 + 2*x + x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*P[n - 2, x])/(n - 2)]];\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; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*v[i - 2])/(n - 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-e9d97f6728dd613c","steps":[],"edges":[],"text":"A026386"},"headline":"A026386: Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1.","chain":null}
