{"id":"n-afb1686ffa6592c0","revision":0,"first_index":1,"fingerprint":"f6-d603ab5fdaace463","name":"Riordan array ((1-x)/(1+x), x/(1+x)^2).","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":[["1"],["-2","1"],["2","-4","1"],["-2","9","-6","1"],["2","-16","20","-8","1"],["-2","25","-50","35","-10","1"],["2","-36","105","-112","54","-12","1"],["-2","49","-196","294","-210","77","-14","1"],["2","-64","336","-672","660","-352","104","-16","1"],["-2","81","-540","1386","-1782","1287","-546","135","-18","1"],["2","-100","825","-2640","4290","-4004","2275","-800","170","-20","1"],["-2","121","-1210","4719","-9438","11011","-8008","3740","-1122","209","-22","1"],["2","-144","1716","-8008","19305","-27456","24752","-14688","5814","-1520","252","-24","1"],["-2","169","-2366","13013","-37180","63206","-68952","50388","-25194","8645","-2002","299","-26","1"],["2","-196","3185","-20384","68068","-136136","176358","-155040","94962","-40964","12397","-2576","350","-28","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-1","-1","2","-1","-1","2","-1","-1","2","-1","-1","2","-1","-1"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A110162","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["-2","1"],["2","-4","1"]],"recurrence":{"denominator":{"coeffs":[["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["6","-3"],["-2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["3"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169325,"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-341476417f780961","e-3946aee10636c4f6"]},{"id":169326,"position":1,"claim":"interlacing","from_index":3,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":3,"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 >= 3","region_exact":null,"edges":["e-341476417f780961","e-6a535a5524b82f20"]},{"id":169327,"position":2,"claim":"interlacing","from_index":3,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":3,"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 >= 3","region_exact":null,"edges":["e-3946aee10636c4f6"]},{"id":169328,"position":3,"claim":"real_rooted","from_index":1,"region_key":"(0, 4)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"0"},"upper":{"closed":false,"value":"4"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (0, 4)","region_exact":null,"edges":["e-6a535a5524b82f20"]},{"id":169329,"position":4,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":true,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n(-x) have one sign","region_exact":null,"edges":["e-6a535a5524b82f20"]}],"region_exact":{},"incoming_edges":[{"id":"e-341476417f780961","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-afb1686ffa6592c0","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":"16b51e87082d756cef403d96adf8c6f11d048caed7104a5d930f3821394f6530","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":3,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-3946aee10636c4f6","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-afb1686ffa6592c0","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":"e7ef5218149705551a67f2999b6d11f2b19b750200fe9434f7986859b3cfdb4a","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":3,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-6a535a5524b82f20","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-afb1686ffa6592c0","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":"b179f0c23e745425c207555897f9881c7071d56dd33eff23ec403bea457e8819","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"0"},"upper":{"closed":false,"value":"4"}}},{"claim":"interlacing","from_index":3,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-296c9d0ea53bd991","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-0722f6e57948ddf4","conclusion_name":"one_plus_derivative of Riordan array ((1-x)/(1+x), x/(1+x)^2)."},{"id":"e-4cc90cb1631fb87e","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-c9d79575c6360af4","conclusion_name":"shift_x_plus_one of Riordan array ((1-x)/(1+x), x/(1+x)^2)."},{"id":"e-b38122b7d5253ee9","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-bfc9def181bdaf52","conclusion_name":"derivative of Riordan array ((1-x)/(1+x), x/(1+x)^2)."}],"used_by_total":3,"links":[{"id":"l-a0a2330d42ee7bad","kind":"oeis_match","node_a_id":"n-afb1686ffa6592c0","node_b_id":null,"fingerprint":null,"oeis_id":"A099837","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":0,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A099837","oeis_nonn":false},"other_id":null,"other":null},{"id":"l-c30d1b7c8ed892f9","kind":"oeis_match","node_a_id":"n-afb1686ffa6592c0","node_b_id":null,"fingerprint":null,"oeis_id":"A110162","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":0,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A110162","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A110162","relation":"identification"},{"oeis_id":"A099837","relation":"match_row_sums"},{"oeis_id":"A110162","relation":"match_triangle"}],"bfiles":[{"node_id":"n-afb1686ffa6592c0","oeis_id":"A099837","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":72,"oeis_terms_available":72,"term_count":200,"raw_size":1223},{"node_id":"n-afb1686ffa6592c0","oeis_id":"A110162","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":13509}],"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:  1;\n   2: -2,   1;\n   3:  2,  -4,    1;\n   4: -2,   9,   -6,    1;\n   5:  2, -16,   20,   -8,     1;\n   6: -2,  25,  -50,   35,   -10,    1;\n   7:  2, -36,  105, -112,    54,  -12,    1;\n   8: -2,  49, -196,  294,  -210,   77,  -14,   1;\n   9:  2, -64,  336, -672,   660, -352,  104, -16,   1;\n  10: -2,  81, -540, 1386, -1782, 1287, -546, 135, -18, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-3)*P(n,x) = -(2*n-6-(n-3)*x)*P(n-1,x) - (n-3)*P(n-2,x) for n >= 4, with P(1,x) = 1, P(2,x) = -2 + x, P(3,x) = 2 - 4*x + x^2.","mathematica":"P[1, x_] := 1;\nP[2, x_] := -2 + x;\nP[3, x_] := 2 - 4*x + x^2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 6 - (n - 3)*x)*P[n - 1, x] - (n - 3)*P[n - 2, x])/(n - 3)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = -2 + x; v[3] = 2 - 4*x + x^2; for(n = 4, N, my(i = n); v[i] = (-(2*n - 6 - (n - 3)*x)*v[i - 1] - (n - 3)*v[i - 2])/(n - 3)); 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}},{"oeis_id":"A110162","target":"triangle","first_row":1,"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: -2,   1;\n  2:  2,  -4,    1;\n  3: -2,   9,   -6,    1;\n  4:  2, -16,   20,   -8,     1;\n  5: -2,  25,  -50,   35,   -10,    1;\n  6:  2, -36,  105, -112,    54,  -12,    1;\n  7: -2,  49, -196,  294,  -210,   77,  -14,   1;\n  8:  2, -64,  336, -672,   660, -352,  104, -16,   1;\n  9: -2,  81, -540, 1386, -1782, 1287, -546, 135, -18, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = -(2*n-4-(n-2)*x)*P(n-1,x) - (n-2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = -2 + x, P(2,x) = 2 - 4*x + x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := -2 + x;\nP[2, x_] := 2 - 4*x + x^2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 4 - (n - 2)*x)*P[n - 1, x] - (n - 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] = -2 + x; v[3] = 2 - 4*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(2*n - 4 - (n - 2)*x)*v[i - 1] - (n - 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":1,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-afb1686ffa6592c0","steps":[],"edges":[],"text":"A110162"},"headline":"A110162: Riordan array ((1-x)/(1+x), x/(1+x)^2).","chain":null}