{"id":"n-25065a706ad43d32","revision":1,"first_index":1,"fingerprint":"f6-c8aa5aaa0c2f2cd0","name":"shift_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"],["6","2"],["22","16","2"],["90","102","30","2"],["394","608","292","48","2"],["1806","3530","2380","660","70","2"],["8558","20256","17670","7040","1290","96","2"],["41586","115598","124026","65030","17430","2282","126","2"],["206098","658048","839048","548128","196028","38080","3752","160","2"],["1037718","3742290","5532120","4338600","1954260","512316","75768","5832","198","2"],["5293446","21278640","35795850","32812800","17898300","5964000","1201620","140160","8670","240","2"],["27297738","121023606","228343830","239786250","153968100","62596380","16156140","2587860","244530","12430","286","2"],["142078746","688686048","1440537516","1706076240","1262393550","607939200","192694920","39805920","5200470","406560","17292","336","2"],["745387038","3921503898","9007661988","11882481468","9965670858","5559622926","2098897944","535505256","90753234","9867286","649220","23452","390","2"],["3937603038","22345512000","55920126990","81332509440","76301575350","48464480064","21295215942","6502898688","1367968602","193921728","17835818","1001728","31122","448","2"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","8","40","224","1344","8448","54912","366080","2489344","17199104","120393728","852017152","6085836800","43818024960","317680680960"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","-3"],["5","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165467,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-5ebd2cd7e542e718"]},{"id":165468,"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-5ebd2cd7e542e718"]},{"id":165469,"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-5ebd2cd7e542e718"]},{"id":165470,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-5ebd2cd7e542e718"]}],"region_exact":{},"incoming_edges":[{"id":"e-5ebd2cd7e542e718","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-25065a706ad43d32","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":"a7b3b967bb872861b2ec158fa64acf91d2aba8755892dc173adc623e3c05183b","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"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-1017d30842b71558","kind":"fingerprint_related","node_a_id":"n-968c9f27d7b2c4c9","node_b_id":"n-25065a706ad43d32","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-968c9f27d7b2c4c9","other":{"id":"n-968c9f27d7b2c4c9","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 double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","3"],["1","8","11"]],"card_rows":[["1"],["1","3"],["1","8","11"],["1","15","51","45"]],"row_sums_preview":["1","4","20","112","672","4224","27456","183040"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["x \u21a6 x/(x+1)"],"edges":["e-c838eb74321cec2f"],"text":"A114687 \u2192 x \u21a6 x/(x+1)"},"headline":"A114687 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-77c7d396c1059f0b","kind":"fingerprint_related","node_a_id":"n-6ad396ce174787e3","node_b_id":"n-25065a706ad43d32","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-6ad396ce174787e3","other":{"id":"n-6ad396ce174787e3","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 peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","1"],["11","8","1"]],"card_rows":[["1"],["3","1"],["11","8","1"],["45","51","15","1"]],"row_sums_preview":["1","4","20","112","672","4224","27456","183040"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318"],"edges":["e-38a7985c4c1aa2e3"],"text":"A114656 \u2192 basis A007318"},"headline":"A114656 \u2192 basis A007318","chain":null}},{"id":"l-7564d71ca5318fbd","kind":"oeis_match","node_a_id":"n-25065a706ad43d32","node_b_id":null,"fingerprint":null,"oeis_id":"A151374","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":"A151374","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e607094b57439f4a","kind":"oeis_match","node_a_id":"n-25065a706ad43d32","node_b_id":null,"fingerprint":null,"oeis_id":"A052701","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":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A052701","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A052701","relation":"match_row_sums"},{"oeis_id":"A151374","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:       6,       2;\n   3:      22,      16,       2;\n   4:      90,     102,      30,       2;\n   5:     394,     608,     292,      48,       2;\n   6:    1806,    3530,    2380,     660,      70,      2;\n   7:    8558,   20256,   17670,    7040,    1290,     96,     2;\n   8:   41586,  115598,  124026,   65030,   17430,   2282,   126,    2;\n   9:  206098,  658048,  839048,  548128,  196028,  38080,  3752,  160,   2;\n  10: 1037718, 3742290, 5532120, 4338600, 1954260, 512316, 75768, 5832, 198, 2;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = (5*n-1+(3*n-3)*x)*P(n-1,x) + (2-2*x^2)*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[((5*n - 1 + (3*n - 3)*x)*P[n - 1, x] + (2 - 2*x^2)*D[P[n - 1, x], x])/(n + 1)]];\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] = ((5*n - 1 + (3*n - 3)*x)*v[i - 1] + (2 - 2*x^2)*deriv(v[i - 1], x))/(n + 1)); 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+1"],"edges":["e-5ebd2cd7e542e718"],"text":"A114655 \u2192 x \u21a6 x+1"},"headline":"A114655 \u2192 x \u21a6 x+1","chain":null}