{"id":"n-495335f6a4ca3289","revision":0,"first_index":0,"fingerprint":"f6-702b8764f2c773f5","name":"Riordan triangle ((1-x)/(1-2*x), x^2/(1-2*x)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["2","1"],["4","3"],["8","8","1"],["16","20","5"],["32","48","18","1"],["64","112","56","7"],["128","256","160","32","1"],["256","576","432","120","9"],["512","1280","1120","400","50","1"],["1024","2816","2816","1232","220","11"],["2048","6144","6912","3584","840","72","1"],["4096","13312","16640","9984","2912","364","13"],["8192","28672","39424","26880","9408","1568","98","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","3","7","17","41","99","239","577","1393","3363","8119","19601","47321","114243"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A201701","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169691,"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":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-bab092beb1d89e12"]},{"id":169692,"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-bab092beb1d89e12"]},{"id":169693,"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-bab092beb1d89e12"]},{"id":169694,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"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 >= 1","region_exact":null,"edges":["e-bab092beb1d89e12"]},{"id":169695,"position":4,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a real-rooted image with every root <= -c/b = 0"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: every PF input has a real-rooted image with every root <= -c/b = 0","region_exact":null,"edges":["e-6dbda24995df7ada"]},{"id":169696,"position":5,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a PF image (zero allowed)"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: every PF input has a PF image (zero allowed)","region_exact":null,"edges":["e-6dbda24995df7ada"]}],"region_exact":{},"incoming_edges":[{"id":"e-6dbda24995df7ada","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-495335f6a4ca3289","premise_count":0,"theorem":"constant current multiplier: P_0 = 1, P_1 = s, P_(k+2) = a P_(k+1) + (b t + c) P_k with a, s >= 0, b > 0.  P_k(t) = Q_k(b t + c) for the rows Q_k with b = 1, c = 0, whose map sends PF inputs to PF outputs (an interlacing-preserving 2 x 2 matrix, Branden, arXiv:1410.6601, Theorem 8.5), so every PF input has a real-rooted image with roots <= -c/b; PF inputs (also those with roots in any [-R, 0]) have PF images if and only if every P_k(0) >= 0, if and only if a^2 + 4c >= 0 and (2s >= a or c >= s^2 - a s) (RealRooted orderTwoBasis_pf_equivalences, basisTransform_orderTwoBasis_preserves_bounded_pf_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"82b6cc87d64b3396dd488f18cd4ffd4cd355ccb9fbbc9645d4013a173c6c1db7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a real-rooted image with every root <= -c/b = 0"},{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a PF image (zero allowed)"}],"premises":[]},{"id":"e-bab092beb1d89e12","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-495335f6a4ca3289","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":null,"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"certificate_hash":"61f4a9f94c3abf847abb6e9552cf1c6781932287a0d494fdcebb328be77ef134","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":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-2a7d7364400e7be6","kind":"oeis_match","node_a_id":"n-495335f6a4ca3289","node_b_id":null,"fingerprint":null,"oeis_id":"A078057","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A078057","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-5c8ecd1f2d13d991","kind":"oeis_match","node_a_id":"n-495335f6a4ca3289","node_b_id":null,"fingerprint":null,"oeis_id":"A001333","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":"A001333","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-624ebdab95a17e26","kind":"oeis_match","node_a_id":"n-495335f6a4ca3289","node_b_id":null,"fingerprint":null,"oeis_id":"A207537","in_catalog":0,"target":"triangle","row_alignment":"node_lengths","rows_matched":13,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":13,"target":"triangle","terms_compared":55},"in_catalog":false,"oeis_id":"A207537","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A201701","relation":"identification"},{"oeis_id":"A001333","relation":"match_row_sums"},{"oeis_id":"A078057","relation":"match_row_sums"},{"oeis_id":"A207537","relation":"match_triangle"}],"bfiles":[{"node_id":"n-495335f6a4ca3289","oeis_id":"A001333","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":32,"oeis_terms_available":32,"term_count":200,"raw_size":8548},{"node_id":"n-495335f6a4ca3289","oeis_id":"A078057","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":32,"oeis_terms_available":32,"term_count":200,"raw_size":8624},{"node_id":"n-495335f6a4ca3289","oeis_id":"A207537","target":"triangle","oeis_offset":1,"first_row":1,"rows_used":61,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":991,"raw_size":16486}],"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;\n  2:   2,   1;\n  3:   4,   3;\n  4:   8,   8,   1;\n  5:  16,  20,   5;\n  6:  32,  48,  18,   1;\n  7:  64, 112,  56,   7;\n  8: 128, 256, 160,  32, 1;\n  9: 256, 576, 432, 120, 9;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*P(n-1,x) + x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] + 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; for(n = 2, N, my(i = n + 1); v[i] = 2*v[i - 1] + x*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":"A207537","target":"triangle","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:   4,    3;\n   4:   8,    8,    1;\n   5:  16,   20,    5;\n   6:  32,   48,   18,   1;\n   7:  64,  112,   56,   7;\n   8: 128,  256,  160,  32,  1;\n   9: 256,  576,  432, 120,  9;\n  10: 512, 1280, 1120, 400, 50, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*P(n-1,x) + x*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] + x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + x; for(n = 3, N, my(i = n); v[i] = 2*v[i - 1] + x*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-495335f6a4ca3289","steps":[],"edges":[],"text":"A201701"},"headline":"A201701: Riordan triangle ((1-x)/(1-2*x), x^2/(1-2*x)).","chain":null}