{"id":"n-3cfe162cb26b4bbf","revision":1,"first_index":1,"fingerprint":"f6-750d4afed6f868fa","name":"basis_map_A013611 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 peaks (1 <= k <= n).","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","4"],["11","32","16"],["45","204","240","64"],["197","1216","2336","1536","256"],["903","7060","19040","21120","8960","1024"],["4279","40512","141360","225280","165120","49152","4096"],["20793","231196","992208","2080960","2231040","1168384","258048","16384"],["103049","1316096","6712384","17540096","25091584","19496960","7684096","1310720","65536"],["518859","7484580","44256960","138835200","250145280","262305792","155172864","47775744","6488064","262144"],["2646723","42557280","286366800","1050009600","2290982400","3053568000","2460917760","1148190720","284098560","31457280","1048576"],["13648869","242047212","1826750640","7673160000","19707916800","32049346560","33087774720","21199749120","8012759040","1629224960","149946368","4194304"],["71039373","1377372096","11524300128","54594439680","161586374400","311264870400","394639196160","326090096640","170409000960","53288632320","9065988096","704643072","16777216"],["372693519","7843007796","72061295904","380239406976","1275605869824","2846526938112","4298542989312","4386859057152","2973801971712","1293324910592","340378255360","49182408704","3271557120","67108864"],["1968801519","44691024000","447361015920","2602640302080","9766601644800","24813813792768","43612602249216","53271746052096","44825595150336","25417708732416","9351105347584","2100775878656","261070258176","15032385536","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","59","553","5541","58107","629799","6999013","79320521","913245487","10651843699","125596518593","1494632730541","17928077470947","216532981070559"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-16","32"],["-1","8","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-4"],["6","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167982,"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-04dd5ccea2819870"]},{"id":167983,"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-04dd5ccea2819870"]},{"id":167984,"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-04dd5ccea2819870"]},{"id":167985,"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-04dd5ccea2819870"]}],"region_exact":{},"incoming_edges":[{"id":"e-04dd5ccea2819870","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-3cfe162cb26b4bbf","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":"23e2545e3fe3f3cb658f8ea233859ffeec01d5c8934eb491804835b8fd1db330","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-0d75f6272d2a2a84","role":"sequence","name":"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 peaks (1 <= k <= n).","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":[],"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:      3,       4;\n   3:     11,      32,       16;\n   4:     45,     204,      240,        64;\n   5:    197,    1216,     2336,      1536,       256;\n   6:    903,    7060,    19040,     21120,      8960,      1024;\n   7:   4279,   40512,   141360,    225280,    165120,     49152,      4096;\n   8:  20793,  231196,   992208,   2080960,   2231040,   1168384,    258048,    16384;\n   9: 103049, 1316096,  6712384,  17540096,  25091584,  19496960,   7684096,  1310720,   65536;\n  10: 518859, 7484580, 44256960, 138835200, 250145280, 262305792, 155172864, 47775744, 6488064, 262144;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = -(n-2-(8*n-16)*x+(16*n-32)*x^2)*P(n-2,x) + (6*n-3+(8*n-4)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + 4*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 2 - (8*n - 16)*x + (16*n - 32)*x^2)*P[n - 2, x] + (6*n - 3 + (8*n - 4)*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 + 4*x; for(n = 3, N, my(i = n); v[i] = (-(n - 2 - (8*n - 16)*x + (16*n - 32)*x^2)*v[i - 2] + (6*n - 3 + (8*n - 4)*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-0d75f6272d2a2a84","steps":["basis A013611"],"edges":["e-04dd5ccea2819870"],"text":"A114656 \u2192 basis A013611"},"headline":"A114656 \u2192 basis A013611","chain":null}