{"id":"n-914a474e9f3b0e2a","revision":1,"first_index":1,"fingerprint":"f6-3d3f3d7068653107","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) 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":[["1"],["3","3"],["13","24","9"],["63","171","135","27"],["321","1152","1404","648","81"],["1683","7515","12420","9180","2835","243"],["8989","48024","100305","102600","52245","11664","729"],["48639","302547","764127","1000755","717255","270459","45927","2187"],["265729","1886208","5589360","8932896","8289540","4463424","1306368","174960","6561"],["1462563","11665971","39679632","74907504","85505868","60194988","25474176","5983632","649539","19683"],["8097453","71700120","275301585","599646240","813384180","709357824","395890740","135943920","26276805","2361960","59049"],["45046719","438439419","1875702015","4631083875","7281840060","7587160812","5278971852","2409067980","687428775","111504195","8444007","177147"],["251595969","2669784192","12592798812","34758658440","62184418065","75425815872","63005475456","36052012656","13766979105","3325639680","459873612","29760696","531441"],["1409933619","16199913483","83519432100","254875714236","511333446195","708097851747","691252683264","476992573200","229584106323","74687241915","15503196852","1851540444","103630995","1594323"],["7923848253","98004709656","548277193737","1833110088264","4076429410053","6348303705744","7097823685953","5744281576176","3347860192677","1379345431464","387807909489","70026917688","7302530781","357128352","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","46","396","3606","33876","324556","3151896","30915046","305543556","3038019876","30354866856","304523343996","3065412858696","30946859111256"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-12","-18"],["1","6","9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","9"],["-6","-6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167354,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-478032ea05246a28"]},{"id":167355,"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-478032ea05246a28"]},{"id":167356,"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-478032ea05246a28"]},{"id":167357,"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-478032ea05246a28"]}],"region_exact":{},"incoming_edges":[{"id":"e-478032ea05246a28","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-914a474e9f3b0e2a","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":"c165994069f685ed602194c74a2eea9e06b79a11ff9d7113e63f2fb93e5890e1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-78ba05b4a3dd925d","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) 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-207cc4a31d136e1b","kind":"oeis_match","node_a_id":"n-914a474e9f3b0e2a","node_b_id":null,"fingerprint":null,"oeis_id":"A084772","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":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A084772","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A084772","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-914a474e9f3b0e2a","oeis_id":"A084772","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":19,"oeis_terms_available":19,"term_count":200,"raw_size":21059}],"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:       1;\n   2:       3,        3;\n   3:      13,       24,        9;\n   4:      63,      171,      135,       27;\n   5:     321,     1152,     1404,      648,       81;\n   6:    1683,     7515,    12420,     9180,     2835,      243;\n   7:    8989,    48024,   100305,   102600,    52245,    11664,      729;\n   8:   48639,   302547,   764127,  1000755,   717255,   270459,    45927,    2187;\n   9:  265729,  1886208,  5589360,  8932896,  8289540,  4463424,  1306368,  174960,   6561;\n  10: 1462563, 11665971, 39679632, 74907504, 85505868, 60194988, 25474176, 5983632, 649539, 19683;\n","recurrence_sentence":"The row polynomials satisfy -(n-1)*P(n,x) = (n-2+(6*n-12)*x+(9*n-18)*x^2)*P(n-2,x) - (6*n-9+(6*n-9)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + 3*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 3 + 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (6*n - 12)*x + (9*n - 18)*x^2)*P[n - 2, x] - (6*n - 9 + (6*n - 9)*x)*P[n - 1, x])/(-n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + 3*x; for(n = 3, N, my(i = n); v[i] = ((n - 2 + (6*n - 12)*x + (9*n - 18)*x^2)*v[i - 2] - (6*n - 9 + (6*n - 9)*x)*v[i - 1])/(-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-78ba05b4a3dd925d","steps":["basis A013610"],"edges":["e-478032ea05246a28"],"text":"A104684 \u2192 basis A013610"},"headline":"A104684 \u2192 basis A013610","chain":null}