{"id":"n-2945487c6c09fbf2","revision":0,"first_index":0,"fingerprint":"f6-c04547a283c37845","name":"shift_x_plus_one of Triangle read by rows. T(n, k) = (1/2) * binomial(2*(n - k + 1), n - k + 1) * binomial(2*n - k, k - 1) for n > 0, T(0, 0) = 1.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","1"],["5","7","2"],["25","43","21","3"],["129","261","174","46","4"],["681","1581","1320","500","85","5"],["3653","9563","9540","4670","1175","141","6"],["19825","57751","66801","39935","13265","2415","217","7"],["108545","348169","457268","322084","132650","32410","4508","316","8"],["598417","2095513","3076632","2490768","1222452","374724","70896","7824","441","9"],["3317445","12591855","20420190","18658740","10618860","3913812","938112","142440","12825","595","10"],["18474633","75549123","134035605","136322835","88185900","37955148","11020548","2137740","267465","20075","781","11"],["103274625","452642061","871688466","976033410","706856370","347780070","118617576","28052376","4516875","475255","30250","1002","12"],["579168825","2708392389","5624628048","6872046324","5505487845","3046785885","1193639304","333295248","65800449","8968245","806520","44148","1261","13"],["3256957317","16186123203","36049055952","47706484098","41873438607","25735827117","11386072698","3667206972","858702273","144231087","16900884","1316406","62699","1561","14"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","14","92","614","4172","28748","200216","1405958","9937676","70614884","503969864","3609968348","25939064504","186882380888"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-3"],["2"]]},"terms":[{"coeff":{"coeffs":[["-2","-4","-2"],["5","10","5"],["-2","-4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["10","4"],["-24","-8"],["12","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176803,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-25c32ef4eca860bf"]},{"id":176804,"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-0cb19e711f1dda39","e-25c32ef4eca860bf"]},{"id":176805,"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-0cb19e711f1dda39","e-25c32ef4eca860bf"]},{"id":176806,"position":3,"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-0cb19e711f1dda39","e-25c32ef4eca860bf"]},{"id":176807,"position":4,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"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-0cb19e711f1dda39"]}],"region_exact":{},"incoming_edges":[{"id":"e-0cb19e711f1dda39","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-2945487c6c09fbf2","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"eb9739009e68129fac6a78d1c111f3bf45cf7f35abed29f44fda247cdd812d9e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-0a5e54eacdb24124","role":"sequence","name":"Triangle read by rows. T(n, k) = (1/2) * binomial(2*(n - k + 1), n - k + 1) * binomial(2*n - k, k - 1) for n > 0, T(0, 0) = 1.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]},{"id":"e-25c32ef4eca860bf","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-2945487c6c09fbf2","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":"69572000289497f6d32c4d73f5b73d14763c0d3fe1c86ee814e8b17368c02f51","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-0a5e54eacdb24124","role":"sequence","name":"Triangle read by rows. T(n, k) = (1/2) * binomial(2*(n - k + 1), n - k + 1) * binomial(2*n - k, k - 1) for n > 0, T(0, 0) = 1.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"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:      1,       1;\n  2:      5,       7,       2;\n  3:     25,      43,      21,       3;\n  4:    129,     261,     174,      46,       4;\n  5:    681,    1581,    1320,     500,      85,      5;\n  6:   3653,    9563,    9540,    4670,    1175,    141,     6;\n  7:  19825,   57751,   66801,   39935,   13265,   2415,   217,    7;\n  8: 108545,  348169,  457268,  322084,  132650,  32410,  4508,  316,   8;\n  9: 598417, 2095513, 3076632, 2490768, 1222452, 374724, 70896, 7824, 441, 9;\n","recurrence_sentence":"The row polynomials satisfy (2*n^2-3*n)*P(n,x) = -(2*n^2-5*n+2+(4*n^2-10*n+4)*x+(2*n^2-5*n+2)*x^2)*P(n-2,x) + (12*n^2-24*n+10+(4*n^2-8*n+4)*x)*P(n-1,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[Together[(-(2*n^2 - 5*n + 2 + (4*n^2 - 10*n + 4)*x + (2*n^2 - 5*n + 2)*x^2)*P[n - 2, x] + (12*n^2 - 24*n + 10 + (4*n^2 - 8*n + 4)*x)*P[n - 1, x])/(2*n^2 - 3*n)]];\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] = (-(2*n^2 - 5*n + 2 + (4*n^2 - 10*n + 4)*x + (2*n^2 - 5*n + 2)*x^2)*v[i - 2] + (12*n^2 - 24*n + 10 + (4*n^2 - 8*n + 4)*x)*v[i - 1])/(2*n^2 - 3*n)); 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-0a5e54eacdb24124","steps":["basis A007318"],"edges":["e-0cb19e711f1dda39"],"text":"A360282 \u2192 basis A007318"},"headline":"A360282 \u2192 basis A007318","chain":null}