{"id":"n-d2980b44b9e1faf3","revision":1,"first_index":0,"fingerprint":"f6-6ca9b4f5705da4eb","name":"basis-map coefficients of Riordan array (1+2x,x(1+x)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":false,"rows":[["1"],["1","1"],["-2","1","1"],["1","-3","1","1"],["1","1","-4","1","1"],["-2","4","1","-5","1","1"],["1","-6","8","1","-6","1","1"],["1","1","-11","13","1","-7","1","1"],["-2","7","-2","-17","19","1","-8","1","1"],["1","-9","21","-9","-24","26","1","-9","1","1"],["1","1","-21","45","-21","-32","34","1","-10","1","1"],["-2","10","-8","-36","81","-39","-41","43","1","-11","1","1"],["1","-12","40","-38","-51","131","-64","-51","53","1","-12","1","1"],["1","1","-34","106","-104","-62","197","-97","-62","64","1","-13","1","1"],["-2","13","-17","-62","223","-224","-64","281","-139","-74","76","1","-14","1","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","0","0","0","0","0","0","0","0","0","0","0","0","0"],"nonn":false,"definitions":[{"position":0,"source":"derived:basis_map_coefficients_of:oeis_catalog:A113214","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160546,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-3, 1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":true,"value":"1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-3, 1]","region_exact":null,"edges":["e-fa99d43ba99a1c05"]},{"id":160547,"position":1,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-fa99d43ba99a1c05"]}],"region_exact":{},"incoming_edges":[{"id":"e-fa99d43ba99a1c05","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-d2980b44b9e1faf3","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"c832a8b30b5725025e24d2152edada5569b212fa1fce10d996bb6be27cabe554","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":true,"value":"1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-c27b11147fce8bfa","role":"sequence","name":"Riordan array (1+2x,x(1+x)).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-4, 0]"}]}],"used_by":[{"id":"e-719615516772b132","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-c27b11147fce8bfa","conclusion_name":"Riordan array (1+2x,x(1+x))."}],"used_by_total":1,"links":[{"id":"l-20a3b510b5ef1a9b","kind":"oeis_match","node_a_id":"n-d2980b44b9e1faf3","node_b_id":null,"fingerprint":null,"oeis_id":"A130779","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A130779","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-77f30f0a2f5bc82a","kind":"oeis_match","node_a_id":"n-d2980b44b9e1faf3","node_b_id":null,"fingerprint":null,"oeis_id":"A130706","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":"A130706","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A130706","relation":"match_row_sums"},{"oeis_id":"A130779","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-d2980b44b9e1faf3","oeis_id":"A130706","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":105,"oeis_terms_available":105,"term_count":200,"raw_size":1090}],"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: -2,  1,   1;\n  3:  1, -3,   1,   1;\n  4:  1,  1,  -4,   1,   1;\n  5: -2,  4,   1,  -5,   1,  1;\n  6:  1, -6,   8,   1,  -6,  1,  1;\n  7:  1,  1, -11,  13,   1, -7,  1,  1;\n  8: -2,  7,  -2, -17,  19,  1, -8,  1, 1;\n  9:  1, -9,  21,  -9, -24, 26,  1, -9, 1, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(1-x)*P(n-1,x) - (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[-(1 - x)*P[n - 1, x] - (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] = -(1 - x)*v[i - 1] - (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}}],"derivation":{"root":"n-c27b11147fce8bfa","steps":["x \u21a6 x\u22121"],"edges":["e-fa99d43ba99a1c05"],"text":"A113214 \u2192 x \u21a6 x\u22121"},"headline":"A113214 \u2192 x \u21a6 x\u22121","chain":null}