{"id":"n-9aec4822212db1dc","revision":1,"first_index":0,"fingerprint":"f6-2c0f1fe74efc2e1a","name":"Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).","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"],["3","4"],["5","40","16"],["7","140","336","64"],["9","336","2016","2304","256"],["11","660","7392","21120","14080","1024"],["13","1144","20592","109824","183040","79872","4096"],["15","1820","48048","411840","1281280","1397760","430080","16384"],["17","2720","99008","1244672","6223360","12673024","9748480","2228224","65536"],["19","3876","186048","3224832","23648768","77395968","111132672","63504384","11206656","262144"],["21","5320","325584","7441920","75246080","361181184","833495040","889061376","392232960","55050240","1048576"],["23","7084","538384","15690048","209200640","1384527872","4686094336","8033304576","6615662592","2321285120","265289728","4194304"],["25","9200","850080","30764800","523001600","4564377600","21300428800","53555363840","70882099200","46425702400","13264486400","1258291200","16777216"],["27","11700","1291680","56833920","1199827200","13350804480","82158796800","284817162240","552880373760","581979340800","310388981760","73610035200","5888802816","67108864"],["29","14616","1900080","99889920","2563841280","35427624960","277970595840","1270722723840","3401051996160","5250746941440","4500640235520","1992378286080","398475657216","27246198784","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","61","547","4921","44287","398581","3587227","32285041","290565367","2615088301","23535794707","211822152361","1906399371247","17157594341221"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A085841","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","8","-16"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158938,"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-031667aece1ffd0c"]},{"id":158939,"position":1,"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-c0dcd56725ae4481"]},{"id":158940,"position":2,"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-c0dcd56725ae4481"]},{"id":158941,"position":3,"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-c0dcd56725ae4481"]},{"id":158942,"position":4,"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-c0dcd56725ae4481"]}],"region_exact":{},"incoming_edges":[{"id":"e-031667aece1ffd0c","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-9aec4822212db1dc","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":"3efd5200363e02f88be5bb58ca5376d1648e65a84885a149dd9139bdd13bb3f9","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[]},{"id":"e-c0dcd56725ae4481","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-9aec4822212db1dc","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":"731e4750c540a737334ba6256f1a616ac22e6422eee6c3c200675e6564bbd9ba","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-51fc7cec3579afbb","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-005feda0eb52ceea","conclusion_name":"basis_map_A013610 of Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! )."},{"id":"e-8c1265744c32866c","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-0dae7def259375c0","conclusion_name":"basis_map_A007318 of Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! )."},{"id":"e-b4660546a5e77fa6","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-393cac5827041b9e","conclusion_name":"basis_map_A013609 of Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! )."},{"id":"e-cc801bbe6c76dcc1","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-f8b6d9dc74d7feb1","conclusion_name":"basis_map_A013611 of Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! )."},{"id":"e-db4d4459bbf9061f","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-7f78ef09e94071ba","conclusion_name":"basis_map_A008277 of Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! )."}],"used_by_total":5,"links":[{"id":"l-1ec4fa9ec59e781c","kind":"oeis_match","node_a_id":"n-9aec4822212db1dc","node_b_id":null,"fingerprint":null,"oeis_id":"A085841","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":36},"in_catalog":true,"oeis_id":"A085841","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f906b0b7209862d3","kind":"oeis_match","node_a_id":"n-9aec4822212db1dc","node_b_id":null,"fingerprint":null,"oeis_id":"A066443","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":"A066443","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A085841","relation":"identification"},{"oeis_id":"A066443","relation":"match_row_sums"},{"oeis_id":"A085841","relation":"match_triangle"}],"bfiles":[{"node_id":"n-9aec4822212db1dc","oeis_id":"A066443","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":19,"oeis_terms_available":19,"term_count":200,"raw_size":19954},{"node_id":"n-9aec4822212db1dc","oeis_id":"A085841","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":36,"oeis_terms_agreeing":36,"oeis_terms_available":36,"term_count":990,"raw_size":25393}],"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:  3,    4;\n  2:  5,   40,     16;\n  3:  7,  140,    336,      64;\n  4:  9,  336,   2016,    2304,      256;\n  5: 11,  660,   7392,   21120,    14080,     1024;\n  6: 13, 1144,  20592,  109824,   183040,    79872,      4096;\n  7: 15, 1820,  48048,  411840,  1281280,  1397760,    430080,    16384;\n  8: 17, 2720,  99008, 1244672,  6223360, 12673024,   9748480,  2228224,    65536;\n  9: 19, 3876, 186048, 3224832, 23648768, 77395968, 111132672, 63504384, 11206656, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+8*x)*P(n-1,x) - (1-8*x+16*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[(2 + 8*x)*P[n - 1, x] - (1 - 8*x + 16*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] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 8*x)*v[i - 1] - (1 - 8*x + 16*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":"A085841","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:  3,    4;\n  2:  5,   40,     16;\n  3:  7,  140,    336,      64;\n  4:  9,  336,   2016,    2304,      256;\n  5: 11,  660,   7392,   21120,    14080,     1024;\n  6: 13, 1144,  20592,  109824,   183040,    79872,      4096;\n  7: 15, 1820,  48048,  411840,  1281280,  1397760,    430080,    16384;\n  8: 17, 2720,  99008, 1244672,  6223360, 12673024,   9748480,  2228224,    65536;\n  9: 19, 3876, 186048, 3224832, 23648768, 77395968, 111132672, 63504384, 11206656, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+8*x)*P(n-1,x) - (1-8*x+16*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[(2 + 8*x)*P[n - 1, x] - (1 - 8*x + 16*x^2)*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] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 8*x)*v[i - 1] - (1 - 8*x + 16*x^2)*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-9aec4822212db1dc","steps":[],"edges":[],"text":"A085841"},"headline":"A085841: Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).","chain":null}