{"id":"n-22896c6867f82de3","revision":1,"first_index":0,"fingerprint":"f6-e4f4f1515458a372","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"],["-4","1"],["18","-9","1"],["-84","62","-14","1"],["396","-384","131","-19","1"],["-1872","2244","-1024","225","-24","1"],["8856","-12636","7218","-2129","344","-29","1"],["-41904","69336","-47556","17618","-3824","488","-34","1"],["198288","-373248","298728","-133272","36369","-6234","657","-39","1"],["-938304","1979856","-1810944","945096","-310924","67021","-9484","851","-44","1"],["4440096","-10379664","10679904","-6383160","2459154","-639277","113749","-13699","1070","-49","1"],["-21010752","53900640","-61613568","41497344","-18327444","5581766","-1197846","181353","-19004","1314","-54","1"],["99423936","-277696512","349122960","-261618768","130323924","-45523224","11447071","-2090021","275258","-25524","1583","-59","1"],["-470479104","1421188416","-1948852224","1608237936","-892100304","351645228","-101436808","21701233","-3446192","401514","-33384","1877","-64","1"],["2226331008","-7232006592","10741867488","-9679444272","5917277448","-2598508404","846060426","-207657009","38636816","-5426874","566796","-42709","2196","-69","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-3","10","-35","125","-450","1625","-5875","21250","-76875","278125","-1006250","3640625","-13171875","47656250"],"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"],["-4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-6","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160564,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(2, 6]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"2"},"upper":{"closed":true,"value":"6"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (2, 6]","region_exact":null,"edges":["e-defa6799aaae8d2a"]},{"id":160565,"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-defa6799aaae8d2a"]},{"id":160566,"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-defa6799aaae8d2a"]}],"region_exact":{},"incoming_edges":[{"id":"e-defa6799aaae8d2a","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-6\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-22896c6867f82de3","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":"4adb047fcac98ecc4ecacb6276b518d7975e1b37cd7d23944508b5b9cefa032b","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"2"},"upper":{"closed":true,"value":"6"}}},{"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-2011332c4965ce14","operation":"basis_map","operation_detail":"A038255","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:      -4,       1;\n  2:      18,      -9,        1;\n  3:     -84,      62,      -14,       1;\n  4:     396,    -384,      131,     -19,       1;\n  5:   -1872,    2244,    -1024,     225,     -24,     1;\n  6:    8856,  -12636,     7218,   -2129,     344,   -29,     1;\n  7:  -41904,   69336,   -47556,   17618,   -3824,   488,   -34,   1;\n  8:  198288, -373248,   298728, -133272,   36369, -6234,   657, -39,   1;\n  9: -938304, 1979856, -1810944,  945096, -310924, 67021, -9484, 851, -44, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(6-x)*P(n-1,x) - (6-x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -4 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := -4 + x;\nP[n_, x_] := P[n, x] = Expand[-(6 - x)*P[n - 1, x] - (6 - 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] = -4 + x; for(n = 2, N, my(i = n + 1); v[i] = -(6 - x)*v[i - 1] - (6 - 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\u22126"],"edges":["e-defa6799aaae8d2a"],"text":"A113214 \u2192 x \u21a6 x\u22126"},"headline":"A113214 \u2192 x \u21a6 x\u22126","chain":null}