{"id":"n-a72e2a86e9694248","revision":0,"first_index":1,"fingerprint":"f6-2c6cd6b0f6303dd6","name":"basis_map_A013609 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","8"],["61","128","64"],["595","1800","1728","512"],["6145","24320","34560","20480","4096"],["65527","320840","605440","542720","225280","32768"],["712909","4162176","9806400","11816960","7557120","2359296","262144"],["7863667","53331656","150752448","228569600","198553600","97026048","23855104","2097152"],["87615745","676981760","2232810496","4083236864","4492902400","3009413120","1174405120","234881024","16777216"],["983726695","8530832520","32162780160","68896235520","91866120192","78405304320","42278584320","13589544960","2264924160","134217728"],["11112210781","106872295040","453406040640","1113564856320","1745348935680","1812760363008","1252172759040","560191242240","151749918720","21474836480","1073741824"],["126142119187","1332489936008","6282753400000","17404748444160","31361590149120","38409689235456","32411357282304","18664862515200","7083927797760","1646180433920","200789721088","8589934592"],["1437751935361","16547700250368","85845347368704","264810448179200","539381987020800","761343894355968","759775755239424","536382057480192","263218161254400","86221468467200","17433272254464","1855425871872","68719476736"],["16443380994775","204811885820360","1159352487191808","3941129064384512","8954749784780800","14316515292119040","16503625073295360","13816077540655104","8338786228371456","3546411538841600","1016468435107840","180904022507520","16973710753792","549755813888"],["188609259215725","2527710865769600","15503673689358400","57584520490864640","144400446166552576","257952215619338240","337432989869015040","327006614055813120","234627619671244800","123100776384954368","45985983983779840","11662725994250240","1844774352977920","153931627888640","4398046511104"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","15","253","4635","89601","1792575","36677005","762049275","16009023745","339112270575","7229727199773","154933120968795","3334321989154689","72012798200637855","1559976990077534253"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["7","8"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-50","-160","-128"],["25","80","64"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["21","24"],["-14","-16"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":200425,"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-e2b6810b2fe9f13f"]},{"id":200426,"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-e2b6810b2fe9f13f"]},{"id":200427,"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-e2b6810b2fe9f13f"]},{"id":200428,"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-e2b6810b2fe9f13f"]}],"region_exact":{},"incoming_edges":[{"id":"e-e2b6810b2fe9f13f","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-a72e2a86e9694248","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":"8681fcdacc43dea3152eb1c5ad5327f6f5e47af5a0d8237d64bb2379ef812d69","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-bc61b21caab4d256","kind":"fingerprint_related","node_a_id":"n-a72e2a86e9694248","node_b_id":"n-219b4be2425389c0","fingerprint":"f6-2c6cd6b0f6303dd6","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-2c6cd6b0f6303dd6"},"other_id":"n-219b4be2425389c0","other":{"id":"n-219b4be2425389c0","name":"basis_map_A013609 of basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-2c6cd6b0f6303dd6","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["61","128","64"],["595","1800","1728","512"],["6145","24320","34560","20480","4096"]],"card_rows":[["61","128","64"],["595","1800","1728","512"],["6145","24320","34560","20480","4096"],["65527","320840","605440","542720","225280","32768"]],"row_sums_preview":["253","4635","89601","1792575","36677005","762049275","16009023745","339112270575"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609","basis A013609"],"edges":["e-060b1f8a928003b3","e-8bdd646a4ba02266"],"text":"A133214 \u2192 basis A013609 \u2192 basis A013609"},"headline":"A133214 \u2192 basis A013609 \u2192 basis A013609","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,          8;\n   3:        61,        128,          64;\n   4:       595,       1800,        1728,         512;\n   5:      6145,      24320,       34560,       20480,        4096;\n   6:     65527,     320840,      605440,      542720,      225280,       32768;\n   7:    712909,    4162176,     9806400,    11816960,     7557120,     2359296,      262144;\n   8:   7863667,   53331656,   150752448,   228569600,   198553600,    97026048,    23855104,     2097152;\n   9:  87615745,  676981760,  2232810496,  4083236864,  4492902400,  3009413120,  1174405120,   234881024,   16777216;\n  10: 983726695, 8530832520, 32162780160, 68896235520, 91866120192, 78405304320, 42278584320, 13589544960, 2264924160, 134217728;\n","recurrence_sentence":"The row polynomials satisfy -(n-1)*P(n,x) = (25*n-50+(80*n-160)*x+(64*n-128)*x^2)*P(n-2,x) - (14*n-21+(16*n-24)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 7 + 8*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 7 + 8*x;\nP[n_, x_] := P[n, x] = Expand[Together[((25*n - 50 + (80*n - 160)*x + (64*n - 128)*x^2)*P[n - 2, x] - (14*n - 21 + (16*n - 24)*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 + 8*x; for(n = 3, N, my(i = n); v[i] = ((25*n - 50 + (80*n - 160)*x + (64*n - 128)*x^2)*v[i - 2] - (14*n - 21 + (16*n - 24)*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 A013609"],"edges":["e-99f7e1fd97b5ca9c","e-e2b6810b2fe9f13f"],"text":"A104684 \u2192 basis A013611 \u2192 basis A013609"},"headline":"A104684 \u2192 basis A013611 \u2192 basis A013609","chain":null}