{"id":"n-36ff311318433b63","revision":0,"first_index":1,"fingerprint":"f6-2999dcf3b57aaeda","name":"basis_map_A013610 of basis_map_A013611 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"],["7","12"],["61","192","144"],["595","2700","3888","1728"],["6145","36480","77760","69120","20736"],["65527","481260","1362240","1831680","1140480","248832"],["712909","6243264","22064400","39882240","38257920","17915904","2985984"],["7863667","79997484","339193008","771422400","1005177600","736791552","271724544","35831808"],["87615745","1015472640","5023823616","13780924416","22745318400","22852730880","13377208320","4013162496","429981696"],["983726695","12796248780","72366255360","232524794880","465072233472","595390279680","481579499520","232190115840","58047528960","5159780352"],["11112210781","160308442560","1020163591440","3758281390080","8835828986880","13765649006592","14263030333440","9571392552960","3889184440320","825564856320","61917364224"],["126142119187","1998734904012","14136195150000","58741025999040","158768050129920","291673577631744","369185616543744","318906674380800","181553321410560","63284706017280","11578547109888","743008370688"],["1437751935361","24821550375552","193152031579584","893735262604800","2730621309292800","5781455197765632","8654320712024064","9164590310227968","6745993578086400","3314642898124800","1005290325540864","160489808068608","8916100448256"],["16443380994775","307217828730540","2608543096181568","13301310592297728","45333420785452800","108716037999528960","187986604350504960","236060637354786816","213713970485723136","136335973279334400","58614692016291840","15647756286689280","2202276810719232","106993205379072"],["188609259215725","3791566298654400","34883265801056400","194347756656668160","731027258718172416","1958824637359349760","3843572650226749440","5587214569844244480","6013249268214988800","4732407385908314112","2651783562752163840","1008797325050511360","239352716533432320","29958097506140160","1283918464548864"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","19","397","8911","210241","5130019","128062621","3248002063","83326238209","2156110463539","56162433175597","1470695599766863","38679466836074689","1020951877472615107","27030682588594210237"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["7","12"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-50","-240","-288"],["25","120","144"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["21","36"],["-14","-24"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":203250,"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-d566881147a680c8"]},{"id":203251,"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-d566881147a680c8"]},{"id":203252,"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-d566881147a680c8"]},{"id":203253,"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-d566881147a680c8"]}],"region_exact":{},"incoming_edges":[{"id":"e-d566881147a680c8","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-36ff311318433b63","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":"1e086c2462fe337629197a6d1b6176c10bf04db4decc3442ba908b9df0535d2b","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-6373ae06480cbab5","role":"sequence","name":"basis_map_A013611 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.","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-84d55cb34f318c00","kind":"fingerprint_related","node_a_id":"n-36ff311318433b63","node_b_id":"n-f018f7f0d15d5041","fingerprint":"f6-2999dcf3b57aaeda","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-2999dcf3b57aaeda"},"other_id":"n-f018f7f0d15d5041","other":{"id":"n-f018f7f0d15d5041","name":"basis_map_A013610 of basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-2999dcf3b57aaeda","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["61","192","144"],["595","2700","3888","1728"],["6145","36480","77760","69120","20736"]],"card_rows":[["61","192","144"],["595","2700","3888","1728"],["6145","36480","77760","69120","20736"],["65527","481260","1362240","1831680","1140480","248832"]],"row_sums_preview":["397","8911","210241","5130019","128062621","3248002063","83326238209","2156110463539"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609","basis A013610"],"edges":["e-060b1f8a928003b3","e-1f35af42ff238408"],"text":"A133214 \u2192 basis A013609 \u2192 basis A013610"},"headline":"A133214 \u2192 basis A013609 \u2192 basis A013610","chain":null}}],"oeis":[],"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:         1;\n   2:         7,          12;\n   3:        61,         192,         144;\n   4:       595,        2700,        3888,         1728;\n   5:      6145,       36480,       77760,        69120,        20736;\n   6:     65527,      481260,     1362240,      1831680,      1140480,       248832;\n   7:    712909,     6243264,    22064400,     39882240,     38257920,     17915904,      2985984;\n   8:   7863667,    79997484,   339193008,    771422400,   1005177600,    736791552,    271724544,     35831808;\n   9:  87615745,  1015472640,  5023823616,  13780924416,  22745318400,  22852730880,  13377208320,   4013162496,   429981696;\n  10: 983726695, 12796248780, 72366255360, 232524794880, 465072233472, 595390279680, 481579499520, 232190115840, 58047528960, 5159780352;\n","recurrence_sentence":"The row polynomials satisfy -(n-1)*P(n,x) = (25*n-50+(120*n-240)*x+(144*n-288)*x^2)*P(n-2,x) - (14*n-21+(24*n-36)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 7 + 12*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 7 + 12*x;\nP[n_, x_] := P[n, x] = Expand[Together[((25*n - 50 + (120*n - 240)*x + (144*n - 288)*x^2)*P[n - 2, x] - (14*n - 21 + (24*n - 36)*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] = 7 + 12*x; for(n = 3, N, my(i = n); v[i] = ((25*n - 50 + (120*n - 240)*x + (144*n - 288)*x^2)*v[i - 2] - (14*n - 21 + (24*n - 36)*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 A013611","basis A013610"],"edges":["e-99f7e1fd97b5ca9c","e-d566881147a680c8"],"text":"A104684 \u2192 basis A013611 \u2192 basis A013610"},"headline":"A104684 \u2192 basis A013611 \u2192 basis A013610","chain":null}