{"id":"n-146d64c3583c8509","revision":1,"first_index":0,"fingerprint":"f6-f60b2631b48d7d2e","name":"basis_map_A013609 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 double rises (0 <= k <= n-1).","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"],["3","4"],["11","28","16"],["45","168","192","64"],["197","968","1664","1152","256"],["903","5500","12640","13440","6400","1024"],["4279","31092","89520","128960","96000","33792","4096"],["20793","175504","607488","1106560","1128960","630784","172032","16384"],["103049","990736","4006912","8834560","11490304","8888320","3899392","851968","65536"],["518859","5597172","25903296","67081728","106251264","105541632","64684032","23003136","4128768","262144"],["2646723","31655820","164986320","490945920","917683200","1116229632","884244480","442859520","130744320","19660800","1048576"],["13648869","179251512","1038966720","3493490880","7531814400","10858315776","10585817088","6893568000","2887188480","720896000","92274688","4194304"],["71039373","1016258904","6484376448","24315561600","59421415680","99150999552","115021479936","92604137472","50704220160","18080071680","3875536896","427819008","16777216"],["372693519","5768527596","40179608352","166252944000","454265121024","861642642432","1160634089472","1115966472192","758625533952","355410378752","109460848640","20392706048","1962934272","67108864"],["1968801519","32780930532","247500694896","1120186337088","3384772495104","7195702305792","11047442165760","12370821365760","10077379952640","5884457779200","2392094408704","643896967168","105344139264","8925478912","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","55","469","4237","39907","387739","3858505","39130777","402972031","4202705311","44299426717","471189693925","5051001609115","54513542257795"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","8","16"],["-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":166618,"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-01612a21c966f541","e-452beb3fe1708cbf"]},{"id":166619,"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-01612a21c966f541","e-452beb3fe1708cbf"]},{"id":166620,"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-01612a21c966f541","e-452beb3fe1708cbf"]},{"id":166621,"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-01612a21c966f541","e-452beb3fe1708cbf"]}],"region_exact":{},"incoming_edges":[{"id":"e-01612a21c966f541","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-146d64c3583c8509","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":"bcefd9e3bf1e84e7989f6a6be38515e23bb471d0bfa2c543c979516630ed70c0","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-8ce61d302cec295b","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 double rises (0 <= k <= n-1).","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]"}]},{"id":"e-452beb3fe1708cbf","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-146d64c3583c8509","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":"1ff64610911cc64d5b94bb7c7ceb3559484cda28e51a5ba7943c058f5f8f77e9","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-57b4b14604f4c0d7","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","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-88556e8ab77bb080","kind":"oeis_match","node_a_id":"n-146d64c3583c8509","node_b_id":null,"fingerprint":null,"oeis_id":"A078018","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A078018","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A078018","relation":"match_row_sums"}],"bfiles":[],"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:      3,       4;\n  2:     11,      28,       16;\n  3:     45,     168,      192,       64;\n  4:    197,     968,     1664,     1152,       256;\n  5:    903,    5500,    12640,    13440,      6400,      1024;\n  6:   4279,   31092,    89520,   128960,     96000,     33792,     4096;\n  7:  20793,  175504,   607488,  1106560,   1128960,    630784,   172032,    16384;\n  8: 103049,  990736,  4006912,  8834560,  11490304,   8888320,  3899392,   851968,   65536;\n  9: 518859, 5597172, 25903296, 67081728, 106251264, 105541632, 64684032, 23003136, 4128768, 262144;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1+(8*n-8)*x+(16*n-16)*x^2)*P(n-2,x) + (6*n+3+(8*n+4)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1 + (8*n - 8)*x + (16*n - 16)*x^2)*P[n - 2, x] + (6*n + 3 + (8*n + 4)*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] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1 + (8*n - 8)*x + (16*n - 16)*x^2)*v[i - 2] + (6*n + 3 + (8*n + 4)*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-8ce61d302cec295b","steps":["basis A013609"],"edges":["e-01612a21c966f541"],"text":"A114687 \u2192 basis A013609"},"headline":"A114687 \u2192 basis A013609","chain":null}