{"id":"n-1eae5c7270ad0739","revision":1,"first_index":1,"fingerprint":"f6-f01cd712f19a05d6","name":"Triangle read by rows: coefficients of a Bessel polynomial recursion: P(x, n) = 2*(n-1)*P(x, n - 1)/x - n*P(x, n - 2) with substitution x -> 1/y.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":false,"rows":[["-2","0","2"],["0","-11","0","8"],["8","0","-74","0","48"],["0","119","0","-632","0","384"],["-48","0","1634","0","-6608","0","3840"],["0","-1409","0","24032","0","-81984","0","46080"],["384","0","-32798","0","389312","0","-1178496","0","645120"],["0","18825","0","-741056","0","6966848","0","-19270656","0","10321920"],["-3840","0","666830","0","-17232128","0","137188224","0","-353323008","0","185794560"],["0","-283875","0","21488216","0","-421277888","0","2955741696","0","-7180001280","0","3715891200"],["46080","0","-14247210","0","679526288","0","-10914372224","0","69266193408","0","-160189562880","0","81749606400"],["0","4796295","0","-621279848","0","21785243456","0","-300369575424","0","1755728658432","0","-3892856094720","0","1961990553600"],["-645120","0","324164610","0","-25666644080","0","719217540992","0","-8779335668736","0","47891598999552","0","-102358752952320","0","51011754393600"],["0","-90007785","0","18395806800","0","-1045444686080","0","24643634779136","0","-272157328601088","0","1399357613408256","0","-2895474940968960","0","1428329123020800"],["10321920","0","-7886867310","0","962540509280","0","-42870821238272","0","879778414073856","0","-8930985442025472","0","43618468449484800","0","-87680436299366400","0","42849873690624000"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["0","-3","-18","-129","-1182","-13281","-176478","-2704119","-46909362","-908441931","-19422810138","-454337698209","-11540860811502","-316329037248921","-9305217344483598"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A136668","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["-2","0","2"],["0","-11","0","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159268,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-65533d28bec86ec5"]},{"id":159269,"position":1,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-65533d28bec86ec5","e-f1f9c50c96bd4da9"]},{"id":159270,"position":2,"claim":"real_rooted","from_index":1,"region_key":"(-2, 2)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"2"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-2, 2)","region_exact":null,"edges":["e-f1f9c50c96bd4da9"]}],"region_exact":{},"incoming_edges":[{"id":"e-65533d28bec86ec5","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-1eae5c7270ad0739","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":"e6c9ceea70f121647779549cca5f1775b71a3dd05f457957cf1344ac405db552","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-f1f9c50c96bd4da9","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-1eae5c7270ad0739","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":"e9a1474cd328f17f6faca71cb32d45374fb89bdd5f62750b420efbcba6d9a5ba","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"2"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[],"oeis":[{"oeis_id":"A136668","relation":"tail"}],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:    -2,       0,      2;\n   2:     0,     -11,      0,        8;\n   3:     8,       0,    -74,        0,        48;\n   4:     0,     119,      0,     -632,         0,        384;\n   5:   -48,       0,   1634,        0,     -6608,          0,      3840;\n   6:     0,   -1409,      0,    24032,         0,     -81984,         0,      46080;\n   7:   384,       0, -32798,        0,    389312,          0,  -1178496,          0,     645120;\n   8:     0,   18825,      0,  -741056,         0,    6966848,         0,  -19270656,          0,    10321920;\n   9: -3840,       0, 666830,        0, -17232128,          0, 137188224,          0, -353323008,           0, 185794560;\n  10:     0, -283875,      0, 21488216,         0, -421277888,         0, 2955741696,          0, -7180001280,         0, 3715891200;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*n*x*P(n-1,x) - (n+1)*P(n-2,x) for n >= 3, with P(1,x) = -2 + 2*x^2, P(2,x) = -11*x + 8*x^3.","mathematica":"P[1, x_] := -2 + 2*x^2;\nP[2, x_] := -11*x + 8*x^3;\nP[n_, x_] := P[n, x] = Expand[2*n*x*P[n - 1, x] - (n + 1)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = -2 + 2*x^2; v[2] = -11*x + 8*x^3; for(n = 3, N, my(i = n); v[i] = 2*n*x*v[i - 1] - (n + 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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-1eae5c7270ad0739","steps":[],"edges":[],"text":"A136668"},"headline":"Triangle read by rows: coefficients of a Bessel polynomial recursion: P(x, n) = 2*(n-1)*P(x, n - 1)/x - n*P(x, n - 2) with substitution x -> 1/y.","chain":null}