{"id":"n-f3e0631eb8740f76","revision":1,"first_index":0,"fingerprint":"f6-b3267034d12950ac","name":"Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z.","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","1"],["1","4","2"],["1","10","16","6"],["1","20","70","76","24"],["1","35","224","496","428","120"],["1","56","588","2260","3808","2808","720"],["1","84","1344","8140","23008","32152","21096","5040"],["1","120","2772","24772","107328","245560","298688","178848","40320"],["1","165","5280","66352","414596","1424920","2786320","3040848","1690272","362880"],["1","220","9438","160732","1385384","6750240","19523152","33766048","33748704","17628480","3628800"],["1","286","16016","358930","4124224","27314784","110512624","279245920","437233664","406129824","201170880","39916800"],["1","364","26026","749320","11170224","97370016","529279504","1850877280","4191669664","6041435136","5272270848","2493884160","479001600"],["1","455","40768","1478048","27957384","312638160","2213856592","10303142192","32007510304","66168446080","88882027584","73487372544","33378497280","6227020800"],["1","560","61880","2777528","65437216","919309680","8275367920","49749399392","204067341632","574400601280","1098850029440","1388829247104","1095101208576","479753003520","87178291200"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","7","33","191","1304","10241","90865","898409","9791634","116601199","1506023953","20967734143","313009988192","4987192076929"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A358735","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","0"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159932,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-db65c5b95cec1d15"]},{"id":159933,"position":1,"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-67c88de355bdef8b","e-a98b0ab5851394b4","e-db65c5b95cec1d15"]},{"id":159934,"position":2,"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-a98b0ab5851394b4"]},{"id":159935,"position":3,"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-67c88de355bdef8b","e-a98b0ab5851394b4"]},{"id":159936,"position":4,"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-67c88de355bdef8b","e-a98b0ab5851394b4"]},{"id":159937,"position":5,"claim":"real_rooted","from_index":0,"region_key":"(-2, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0)","region_exact":null,"edges":["e-67c88de355bdef8b"]}],"region_exact":{},"incoming_edges":[{"id":"e-67c88de355bdef8b","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f3e0631eb8740f76","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"9bfed8380c7c4ba4e3927a6f7ef1caa23594be8b2be88b903b4fa5009f10235c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-a98b0ab5851394b4","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f3e0631eb8740f76","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"900ce8e02936115276154731ccac9e253cba390cd051d022268411a53a48538f","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":[]},{"id":"e-db65c5b95cec1d15","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f3e0631eb8740f76","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"2616f04dacfbeb731ed3ffd4508b391555b62112b419f48c533c6294cd3f721d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-047e3d1cd6239819","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-65a2a2b634b6736c","conclusion_name":"basis_map_A013609 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."},{"id":"e-2162343c24b290d1","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-8fd05348dab46fd0","conclusion_name":"basis_map_A013611 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."},{"id":"e-393d995dcff5ebfb","operation":"basis_map","operation_detail":"A008288","conclusion_id":"n-ee5b69bc1fbff350","conclusion_name":"basis_map_A008288 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."},{"id":"e-6be4ff430edd1ff3","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-651bc721fc597ed0","conclusion_name":"basis_map_A013610 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."},{"id":"e-b5244cd67a4007b4","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-5a9cc65a6b56090f","conclusion_name":"basis_map_A008277 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."},{"id":"e-d6128f80e98dcc59","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-4a57e8264fe984f4","conclusion_name":"basis_map_A007318 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."},{"id":"e-fca58ee161653196","operation":"basis_map","operation_detail":"A008288","conclusion_id":"n-ee5b69bc1fbff350","conclusion_name":"basis_map_A008288 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z."}],"used_by_total":7,"links":[{"id":"l-946cb8a20cca376a","kind":"oeis_match","node_a_id":"n-f3e0631eb8740f76","node_b_id":null,"fingerprint":null,"oeis_id":"A358735","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":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A358735","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-cd2390f2734561b1","kind":"oeis_match","node_a_id":"n-f3e0631eb8740f76","node_b_id":null,"fingerprint":null,"oeis_id":"A058797","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":-1,"oeis_term_position":3,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A058797","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-fc563c61f2757859","kind":"oeis_match","node_a_id":"n-f3e0631eb8740f76","node_b_id":null,"fingerprint":null,"oeis_id":"A121965","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":3,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A121965","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A358735","relation":"identification"},{"oeis_id":"A058797","relation":"match_row_sums"},{"oeis_id":"A121965","relation":"match_row_sums"},{"oeis_id":"A358735","relation":"match_triangle"}],"bfiles":[{"node_id":"n-f3e0631eb8740f76","oeis_id":"A358735","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":28783}],"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,   4,    2;\n  3: 1,  10,   16,     6;\n  4: 1,  20,   70,    76,     24;\n  5: 1,  35,  224,   496,    428,     120;\n  6: 1,  56,  588,  2260,   3808,    2808,     720;\n  7: 1,  84, 1344,  8140,  23008,   32152,   21096,    5040;\n  8: 1, 120, 2772, 24772, 107328,  245560,  298688,  178848,   40320;\n  9: 1, 165, 5280, 66352, 414596, 1424920, 2786320, 3040848, 1690272, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+n*x)*P(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[(2 + n*x)*P[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] = (2 + n*x)*v[i - 1] - 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":"A358735","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,   4,    2;\n  3: 1,  10,   16,     6;\n  4: 1,  20,   70,    76,     24;\n  5: 1,  35,  224,   496,    428,     120;\n  6: 1,  56,  588,  2260,   3808,    2808,     720;\n  7: 1,  84, 1344,  8140,  23008,   32152,   21096,    5040;\n  8: 1, 120, 2772, 24772, 107328,  245560,  298688,  178848,   40320;\n  9: 1, 165, 5280, 66352, 414596, 1424920, 2786320, 3040848, 1690272, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+n*x)*P(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[(2 + n*x)*P[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] = (2 + n*x)*v[i - 1] - 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}}],"derivation":{"root":"n-f3e0631eb8740f76","steps":[],"edges":[],"text":"A358735"},"headline":"A358735: Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z.","chain":null}