{"id":"n-2ae85de8aa2f7a20","revision":1,"first_index":0,"fingerprint":"f6-03f32002a7d4b1e9","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"],["-5","1"],["28","-11","1"],["-161","93","-17","1"],["931","-707","194","-23","1"],["-5390","5068","-1853","331","-29","1"],["31213","-34986","15974","-3815","504","-35","1"],["-180761","235249","-128765","38509","-6809","713","-41","1"],["1046836","-1551389","989800","-355649","78829","-11051","958","-47","1"],["-6062525","10079055","-7343385","3081015","-821280","144386","-16757","1239","-53","1"],["35109823","-64709351","53002761","-25431147","7922523","-1675796","243928","-24143","1556","-59","1"],["-203331086","411459370","-374245928","202110300","-72058833","17821113","-3121607","387499","-33425","1909","-65","1"],["1177548841","-2595471396","2595452188","-1557997238","625633323","-177153529","36289070","-5421171","586439","-44819","2298","-71","1"],["-6819524285","16262301937","-17732455846","11712414826","-5230908368","1668901402","-391504657","68403167","-8904770","853384","-58541","2723","-77","1"],["39493828108","-101309789231","119625856147","-86217926774","42391342903","-15047510156","3978256982","-796089559","121210313","-13978286","1202266","-74807","3184","-83","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-4","18","-84","396","-1872","8856","-41904","198288","-938304","4440096","-21010752","99423936","-470479104","2226331008"],"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"],["-5","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-7","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-7","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160550,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(3, 7]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"3"},"upper":{"closed":true,"value":"7"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (3, 7]","region_exact":null,"edges":["e-921246387fcf3a1f"]},{"id":160551,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":true,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n(-x) have one sign","region_exact":null,"edges":["e-921246387fcf3a1f"]},{"id":160552,"position":2,"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-921246387fcf3a1f"]}],"region_exact":{},"incoming_edges":[{"id":"e-921246387fcf3a1f","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-7\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-2ae85de8aa2f7a20","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":"5eb9a2d5947cb2f0c3f5208eeda4d3d945815394c7dffe4d6bec79ee9e8ba630","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"3"},"upper":{"closed":true,"value":"7"}}},{"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-9b73612a2d328481","operation":"basis_map","operation_detail":"A027466","conclusion_id":"n-c27b11147fce8bfa","conclusion_name":"Riordan array (1+2x,x(1+x))."}],"used_by_total":1,"links":[],"oeis":[],"bfiles":[],"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:       -5,        1;\n  2:       28,      -11,        1;\n  3:     -161,       93,      -17,       1;\n  4:      931,     -707,      194,     -23,       1;\n  5:    -5390,     5068,    -1853,     331,     -29,      1;\n  6:    31213,   -34986,    15974,   -3815,     504,    -35,      1;\n  7:  -180761,   235249,  -128765,   38509,   -6809,    713,    -41,    1;\n  8:  1046836, -1551389,   989800, -355649,   78829, -11051,    958,  -47,   1;\n  9: -6062525, 10079055, -7343385, 3081015, -821280, 144386, -16757, 1239, -53, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(7-x)*P(n-1,x) - (7-x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -5 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := -5 + x;\nP[n_, x_] := P[n, x] = Expand[-(7 - x)*P[n - 1, x] - (7 - 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] = -5 + x; for(n = 2, N, my(i = n + 1); v[i] = -(7 - x)*v[i - 1] - (7 - 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\u22127"],"edges":["e-921246387fcf3a1f"],"text":"A113214 \u2192 x \u21a6 x\u22127"},"headline":"A113214 \u2192 x \u21a6 x\u22127","chain":null}