{"id":"n-8278948ae532c997","revision":0,"first_index":0,"fingerprint":"f6-06e426b054a33769","name":"shift_x_plus_one of theta_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).","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"],["5","4"],["25","36","12"],["129","264","168","32"],["681","1800","1680","640","80"],["3653","11820","14520","8320","2160","192"],["19825","75852","115500","88480","35280","6720","448"],["108545","479248","870576","835520","451360","134400","19712","1024"],["598417","2994192","6318144","7289856","4979520","2032128","473088","55296","2304"],["3317445","18548820","44583120","60103680","49694400","25853184","8332800","1566720","149760","5120"],["18474633","114148980","307844460","474893760","461186880","292190976","120933120","31764480","4942080","394240","11264"],["103274625","698734872","2089284120","3629699040","4050303840","3028354560","1534815744","521072640","114174720","14981120","1013760","24576"],["579168825","4258447128","13981617936","27013134720","34061536080","29374076160","17644763136","7372265472","2100384000","390973440","43929600","2555904","53248"],["3256957317","25858331772","92479560264","196692752256","276589513200","270367441344","187973769984","93454952448","32917876992","8010562560","1285380096","125239296","6336512","114688"],["18359266785","156531277980","605695397580","1406286292320","2182069890000","2384891885376","1884843280320","1088094458880","457720623360","138291112960","29154757632","4081459200","348508160","15482880","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","73","593","4881","40665","342105","2900385","24742945","212155049","1826784873","15785733617","136822905649","1189018788729","10356383939193"],"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"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["3","2"],["7","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-3","-2"],["-2","-6","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178679,"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-2173204528f0111f"]},{"id":178680,"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-2173204528f0111f"]},{"id":178681,"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-2173204528f0111f"]},{"id":178682,"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-2173204528f0111f"]}],"region_exact":{},"incoming_edges":[{"id":"e-2173204528f0111f","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-8278948ae532c997","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":"eee79a1167ad85d5cd4581f00987979cc039477d971fa0600ef432d058ac4677","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-916d0051af2e0118","role":"sequence","name":"theta_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).","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":[{"id":"l-c473a2982346c502","kind":"fingerprint_related","node_a_id":"n-8278948ae532c997","node_b_id":"n-9ac4272ad66435ce","fingerprint":"f6-06e426b054a33769","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-06e426b054a33769"},"other_id":"n-9ac4272ad66435ce","other":{"id":"n-9ac4272ad66435ce","name":"basis_map_A013609 of basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).","first_index":0,"fingerprint":"f6-06e426b054a33769","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["5","4"]],"card_rows":[["1"],["1"],["5","4"],["25","36","12"]],"row_sums_preview":["1","1","9","73","593","4881","40665","342105"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b1b19325e0094118","steps":["x \u21a6 x+1","basis A013609"],"edges":["e-0de802f77814f187","e-aca6baffd0f2c0d6"],"text":"A367270 \u2192 x \u21a6 x+1 \u2192 basis A013609"},"headline":"A367270 \u2192 x \u21a6 x+1 \u2192 basis A013609","chain":null}}],"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,        4;\n  2:      25,       36,       12;\n  3:     129,      264,      168,       32;\n  4:     681,     1800,     1680,      640,       80;\n  5:    3653,    11820,    14520,     8320,     2160,      192;\n  6:   19825,    75852,   115500,    88480,    35280,     6720,     448;\n  7:  108545,   479248,   870576,   835520,   451360,   134400,   19712,    1024;\n  8:  598417,  2994192,  6318144,  7289856,  4979520,  2032128,  473088,   55296,   2304;\n  9: 3317445, 18548820, 44583120, 60103680, 49694400, 25853184, 8332800, 1566720, 149760, 5120;\n","recurrence_sentence":"The row polynomials satisfy (n^2+n)*P(n,x) = (7*n^2+3*n+(6*n^2+2*n)*x)*P(n-1,x) - (2*n+1+(6*n+3)*x+(4*n+2)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((7*n^2 + 3*n + (6*n^2 + 2*n)*x)*P[n - 1, x] - (2*n + 1 + (6*n + 3)*x + (4*n + 2)*x^2)*D[P[n - 1, x], x])/(n^2 + n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((7*n^2 + 3*n + (6*n^2 + 2*n)*x)*v[i - 1] - (2*n + 1 + (6*n + 3)*x + (4*n + 2)*x^2)*deriv(v[i - 1], x))/(n^2 + 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-8ce61d302cec295b","steps":["\u03b8+1","x \u21a6 x+1"],"edges":["e-2a32d110f0351649","e-2173204528f0111f"],"text":"A114687 \u2192 \u03b8+1 \u2192 x \u21a6 x+1"},"headline":"A114687 \u2192 \u03b8+1 \u2192 x \u21a6 x+1","chain":null}