{"id":"n-ed80a7592b428c53","revision":1,"first_index":0,"fingerprint":"f6-fd15deff59829444","name":"basis_map_A007318 of Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","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"],["4","2"],["36","36","6"],["400","600","240","20"],["4900","9800","6300","1400","70"],["63504","158760","141120","52920","7560","252"],["853776","2561328","2910600","1552320","388080","38808","924"],["11778624","41225184","57081024","39639600","14414400","2594592","192192","3432"],["165636900","662547600","1082161080","927566640","445945500","118918800","16216200","926640","12870"],["2363904400","10637569800","20023660800","20440820400","12264492240","4380175800","898497600","96267600","4375800","48620"],["34134779536","170673897680","363804887160","431176162560","310700470080","139815211536","38837558760","6340825920","548725320","20323160","184756"],["497634306624","2736988686432","6516639729600","8797463634960","7408390429440","4033457011584","1423573062912","317761844400","42368245920","3026303280","93117024","705432"],["7312459672336","43874758034016","115409689611216","174863166077600","168618053003400","107915553922176","46384755633216","13252787323776","2436174140400","270686015600","16241160936","421848336","2704156"],["108172480360000","703121122340000","2024988832339200","3403106232125600","3699028513180000","2723830086978000","1383532742592000","484236459907200","114687582609600","17698701020000","1665760096000","85180914000","1892909200","10400600"],["1609341595560000","11265391168920000","35256501991620000","65088926753760000","78757601372049600","65631334476708000","38522739801546000","16009450307136000","4669423006248000","933884601249600","122879552796000","9929660832000","438073272000","8424486000","40116600"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","78","1260","22470","424116","8305836","166929048","3419932230","71109813060","1496053026468","31777397077608","680354749147164","14664155597771400","317877850826299800"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-12"],["0","0","32"],["0","0","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","2"],["-16","-8"],["16","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161961,"position":0,"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-2cd9cd27e716475b"]},{"id":161962,"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-2cd9cd27e716475b"]},{"id":161963,"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-2cd9cd27e716475b"]},{"id":161964,"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-2cd9cd27e716475b"]}],"region_exact":{},"incoming_edges":[{"id":"e-2cd9cd27e716475b","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-ed80a7592b428c53","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":"6c27013bfe1c31c3f40b59ef37f7fad5877de00ddb8b16fe1474c81657e220b8","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-fdc03fad975441d0","role":"sequence","name":"Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","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-5f4caddde91d34be","kind":"fingerprint_related","node_a_id":"n-ed80a7592b428c53","node_b_id":"n-55a66d3aeb8cbce1","fingerprint":"f6-fd15deff59829444","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-fd15deff59829444"},"other_id":"n-55a66d3aeb8cbce1","other":{"id":"n-55a66d3aeb8cbce1","name":"mobius_x_over_x_plus_one of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-fd15deff59829444","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","6","6"]],"card_rows":[["1"],["1","2"],["1","6","6"],["1","12","30","20"]],"row_sums_preview":["1","3","13","63","321","1683","8989","48639"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["x \u21a6 x/(x+1)"],"edges":["e-2ce1a392fcdf3dd9"],"text":"A008459 \u2192 x \u21a6 x/(x+1)"},"headline":"A008459 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-d4e46f3d8f80f72f","kind":"fingerprint_related","node_a_id":"n-78ba05b4a3dd925d","node_b_id":"n-ed80a7592b428c53","fingerprint":"f6-fd15deff59829444","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-fd15deff59829444"},"other_id":"n-78ba05b4a3dd925d","other":{"id":"n-78ba05b4a3dd925d","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.","first_index":1,"fingerprint":"f6-fd15deff59829444","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["6","6","1"]],"card_rows":[["1"],["2","1"],["6","6","1"],["20","30","12","1"]],"row_sums_preview":["1","3","13","63","321","1683","8989","48639"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A104684"],"derivation":{"root":"n-78ba05b4a3dd925d","steps":[],"edges":[],"text":"A104684"},"headline":"A104684: 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.","chain":null}},{"id":"l-da0483255f9d4194","kind":"fingerprint_related","node_a_id":"n-57c367574a30fd7b","node_b_id":"n-ed80a7592b428c53","fingerprint":"f6-fd15deff59829444","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-fd15deff59829444"},"other_id":"n-57c367574a30fd7b","other":{"id":"n-57c367574a30fd7b","name":"basis_map_A007318 of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-fd15deff59829444","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["6","6","1"]],"card_rows":[["1"],["2","1"],["6","6","1"],["20","30","12","1"]],"row_sums_preview":["1","3","13","63","321","1683","8989","48639"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["x \u21a6 x+1"],"edges":["e-40b4efc61cad5541"],"text":"A008459 \u2192 x \u21a6 x+1"},"headline":"A008459 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-f796bffa2b3edf88","kind":"fingerprint_related","node_a_id":"n-4689fb1386d440ad","node_b_id":"n-ed80a7592b428c53","fingerprint":"f6-fd15deff59829444","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-fd15deff59829444"},"other_id":"n-4689fb1386d440ad","other":{"id":"n-4689fb1386d440ad","name":"T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","first_index":1,"fingerprint":"f6-fd15deff59829444","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","6","6"]],"card_rows":[["1"],["1","2"],["1","6","6"],["1","12","30","20"]],"row_sums_preview":["1","3","13","63","321","1683","8989","48639"],"regions":["(-inf, +inf)","(-inf, 0)","(-1, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A063007"],"derivation":{"root":"n-4689fb1386d440ad","steps":[],"edges":[],"text":"A063007"},"headline":"A063007: T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","chain":null}},{"id":"l-d449a330f534a900","kind":"oeis_match","node_a_id":"n-ed80a7592b428c53","node_b_id":null,"fingerprint":null,"oeis_id":"A268555","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A268555","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A268555","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-ed80a7592b428c53","oeis_id":"A268555","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":18,"oeis_terms_available":18,"term_count":200,"raw_size":27733}],"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:          4,           2;\n  2:         36,          36,           6;\n  3:        400,         600,         240,          20;\n  4:       4900,        9800,        6300,        1400,          70;\n  5:      63504,      158760,      141120,       52920,        7560,        252;\n  6:     853776,     2561328,     2910600,     1552320,      388080,      38808,       924;\n  7:   11778624,    41225184,    57081024,    39639600,    14414400,    2594592,    192192,     3432;\n  8:  165636900,   662547600,  1082161080,   927566640,   445945500,  118918800,  16216200,   926640,   12870;\n  9: 2363904400, 10637569800, 20023660800, 20440820400, 12264492240, 4380175800, 898497600, 96267600, 4375800, 48620;\n","recurrence_sentence":"The row polynomials satisfy n^2*P(n,x) = -(16*n^2-32*n+12)*x^2*P(n-2,x) + (16*n^2-16*n+4+(8*n^2-8*n+2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 4 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(16*n^2 - 32*n + 12)*x^2*P[n - 2, x] + (16*n^2 - 16*n + 4 + (8*n^2 - 8*n + 2)*x)*P[n - 1, x])/(n^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(16*n^2 - 32*n + 12)*x^2*v[i - 2] + (16*n^2 - 16*n + 4 + (8*n^2 - 8*n + 2)*x)*v[i - 1])/(n^2)); 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-fdc03fad975441d0","steps":["basis A007318"],"edges":["e-2cd9cd27e716475b"],"text":"A069466 \u2192 basis A007318"},"headline":"A069466 \u2192 basis A007318","chain":null}