{"id":"n-4a5cb5ea4703a9a6","revision":1,"first_index":1,"fingerprint":"f6-acc791d1c44ba380","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["2"],["4","6"],["8","28","22"],["16","96","168","90"],["32","288","832","968","394"],["64","800","3360","6320","5500","1806"],["128","2112","12000","32240","44760","31092","8558"],["256","5376","39424","141120","276640","303744","175504","41586"],["512","13312","121856","555520","1436288","2208640","2003456","990736","206098"],["1024","32256","359424","2021376","6596352","13281408","16770432","12951648","5597172","1037718"],["2048","76800","1021440","6919680","27632640","69764352","114710400","122736480","82493160","31655820","5293446"],["4096","180224","2816000","22556160","107712000","330806784","678644736","941476800","873372720","519483360","179251512","27297738"],["8192","417792","7569408","70625280","396126720","1446939648","3594421248","6196937472","7427676960","6078890400","3242188224","1016258904","142078746"],["16384","958464","19914752","213790720","1388321792","5926761984","17436976128","36269815296","53852665152","56783140128","41563236000","20089804176","5768527596","745387038"],["32768","2179072","51437568","628805632","4672059392","22986163200","78729530880","193294083840","345232567680","449731394112","423096561888","280046584272","123750347448","32780930532","3937603038"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","10","58","370","2514","17850","130890","983650","7536418","58648810","462306266","3683602130","29620138994","240059315610","1958940281322"],"nonn":true,"definitions":[{"position":0,"source":"derived:mobius_x_over_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["1","2","1"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["2","11","20","15","4"],["2","5","2","-3","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","14","18","10","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165474,"position":0,"claim":"real_rooted","from_index":1,"region_key":"[-1, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in [-1, 0]","region_exact":null,"edges":["e-460d39e35063c243"]},{"id":165475,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-460d39e35063c243"]},{"id":165476,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-460d39e35063c243"]}],"region_exact":{},"incoming_edges":[{"id":"e-460d39e35063c243","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"mobius, shift 0","conclusion_id":"n-4a5cb5ea4703a9a6","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":"fTransform","lean_declarations":["RealRooted.splits_fPolynomial"],"certificate_hash":"17dbb93df80ec5b07b31fd6dccfbed7c7302f5a6f6cec9816142488777ba70e1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-6a30765140629bd5","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-1251c471af319085","kind":"fingerprint_related","node_a_id":"n-b6cda967a092feb1","node_b_id":"n-4a5cb5ea4703a9a6","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-b6cda967a092feb1","other":{"id":"n-b6cda967a092feb1","name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","2"],["11","14","4"]],"card_rows":[["1"],["3","2"],["11","14","4"],["45","84","48","8"]],"row_sums_preview":["1","5","29","185","1257","8925","65445","491825"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["basis A007318"],"edges":["e-6804282af6df94ec"],"text":"A114687 \u2192 basis A007318"},"headline":"A114687 \u2192 basis A007318","chain":null}},{"id":"l-4ac4c6190474a0b9","kind":"fingerprint_related","node_a_id":"n-40fe41bf121fa8b3","node_b_id":"n-4a5cb5ea4703a9a6","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-40fe41bf121fa8b3","other":{"id":"n-40fe41bf121fa8b3","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","3"],["4","14","11"]],"card_rows":[["1"],["2","3"],["4","14","11"],["8","48","84","45"]],"row_sums_preview":["1","5","29","185","1257","8925","65445","491825"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["x \u21a6 x/(x+1)"],"edges":["e-0286c892acd84d8a"],"text":"A114656 \u2192 x \u21a6 x/(x+1)"},"headline":"A114656 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-19739b3287aa0984","kind":"oeis_match","node_a_id":"n-4a5cb5ea4703a9a6","node_b_id":null,"fingerprint":null,"oeis_id":"A086871","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A086871","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A086871","relation":"match_row_sums"}],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","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:    2;\n   2:    4,     6;\n   3:    8,    28,     22;\n   4:   16,    96,    168,      90;\n   5:   32,   288,    832,     968,     394;\n   6:   64,   800,   3360,    6320,    5500,     1806;\n   7:  128,  2112,  12000,   32240,   44760,    31092,     8558;\n   8:  256,  5376,  39424,  141120,  276640,   303744,   175504,    41586;\n   9:  512, 13312, 121856,  555520, 1436288,  2208640,  2003456,   990736,  206098;\n  10: 1024, 32256, 359424, 2021376, 6596352, 13281408, 16770432, 12951648, 5597172, 1037718;\n","recurrence_sentence":"The row polynomials satisfy (n+1+(2*n+2)*x+(n+1)*x^2)*P(n,x) = (2*n+2+(5*n+11)*x+(2*n+20)*x^2-(3*n-15)*x^3-(2*n-4)*x^4)*P(n-1,x) + (4*x+14*x^2+18*x^3+10*x^4+2*x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.","mathematica":"P[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n + 2 + (5*n + 11)*x + (2*n + 20)*x^2 - (3*n - 15)*x^3 - (2*n - 4)*x^4)*P[n - 1, x] + (4*x + 14*x^2 + 18*x^3 + 10*x^4 + 2*x^5)*D[P[n - 1, x], x])/(n + 1 + (2*n + 2)*x + (n + 1)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = ((2*n + 2 + (5*n + 11)*x + (2*n + 20)*x^2 - (3*n - 15)*x^3 - (2*n - 4)*x^4)*v[i - 1] + (4*x + 14*x^2 + 18*x^3 + 10*x^4 + 2*x^5)*deriv(v[i - 1], x))/(n + 1 + (2*n + 2)*x + (n + 1)*x^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-6a30765140629bd5","steps":["x \u21a6 x/(x+1)"],"edges":["e-460d39e35063c243"],"text":"A114655 \u2192 x \u21a6 x/(x+1)"},"headline":"A114655 \u2192 x \u21a6 x/(x+1)","chain":null}