{"id":"n-590c95f2c42d67c1","revision":0,"first_index":0,"fingerprint":"f6-9e57d05d9d9a1ce7","name":"derivative of theta_plus_one 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":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["4"],["12","24"],["24","144","96"],["40","480","960","320"],["60","1200","4800","4800","960"],["84","2520","16800","33600","20160","2688"],["112","4704","47040","156800","188160","75264","7168"],["144","8064","112896","564480","1128960","903168","258048","18432"],["180","12960","241920","1693440","5080320","6773760","3870720","829440","46080"],["220","19800","475200","4435200","18627840","37255680","35481600","15206400","2534400","112640"],["264","29040","871200","10454400","58544640","163924992","234178560","167270400","55756800","7434240","270336"],["312","41184","1510080","22651200","163088640","608864256","1217728512","1304709120","724838400","193290240","21086208","638976"],["364","56784","2498496","45805760","412251840","1978808832","5276823552","7915235328","6596029440","2931568640","639614976","58146816","1490944"],["420","76440","3974880","87447360","961920960","5771525760","19788088320","39576176640","46172206080","30781470720","11193262080","2035138560","156549120","3440640"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","4","36","264","1800","11820","75852","479248","2994192","18548820","114148980","698734872","4258447128","25858331772","156531277980"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["4"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","-6"],["1","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178667,"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-864f23aa09e283a6"]},{"id":178668,"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-864f23aa09e283a6"]},{"id":178669,"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-864f23aa09e283a6"]},{"id":178670,"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-864f23aa09e283a6"]}],"region_exact":{},"incoming_edges":[{"id":"e-864f23aa09e283a6","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-590c95f2c42d67c1","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"6f0322a8c9aa0bd84336fa6f8190860f2645cc5374b76f205d8c57c1aded79a1","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-916d0051af2e0118","role":"sequence","name":"theta_plus_one 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).","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-11e6d5bf16d46d63","kind":"fingerprint_related","node_a_id":"n-590c95f2c42d67c1","node_b_id":"n-8a6e23bd6be57bd4","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-8a6e23bd6be57bd4","other":{"id":"n-8a6e23bd6be57bd4","name":"derivative of theta_plus_one 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).","first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["2"],["12","6"]],"card_rows":[["2"],["12","6"],["48","72","12"],["160","480","240","20"]],"row_sums_preview":["0","2","18","132","900","5910","37926","239624"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["\u03b8+1","D"],"edges":["e-57c7b63013beaaa7","e-58a748c824c4191b"],"text":"A114656 \u2192 \u03b8+1 \u2192 D"},"headline":"A114656 \u2192 \u03b8+1 \u2192 D","chain":null}},{"id":"l-2df17e49818a2d18","kind":"fingerprint_related","node_a_id":"n-0d75f6272d2a2a84","node_b_id":"n-590c95f2c42d67c1","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-0d75f6272d2a2a84","other":{"id":"n-0d75f6272d2a2a84","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).","first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["4","6","1"]],"card_rows":[["1"],["2","1"],["4","6","1"],["8","24","12","1"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A114656"],"derivation":{"root":"n-0d75f6272d2a2a84","steps":[],"edges":[],"text":"A114656"},"headline":"A114656: 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).","chain":null}},{"id":"l-5f3bc14fb057d251","kind":"fingerprint_related","node_a_id":"n-435b4d5bded8f11f","node_b_id":"n-590c95f2c42d67c1","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-435b4d5bded8f11f","other":{"id":"n-435b4d5bded8f11f","name":"reversal of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["2","4"],["2","12","8"]],"card_rows":[["2"],["2","4"],["2","12","8"],["2","24","48","16"]],"row_sums_preview":["2","6","22","90","394","1806","8558","41586"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["reverse"],"edges":["e-a35c7072fcaf677b"],"text":"A114655 \u2192 reverse"},"headline":"A114655 \u2192 reverse","chain":null}},{"id":"l-77bf1fa175d63f28","kind":"fingerprint_related","node_a_id":"n-8ce61d302cec295b","node_b_id":"n-590c95f2c42d67c1","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-8ce61d302cec295b","other":{"id":"n-8ce61d302cec295b","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).","first_index":0,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","6","4"]],"card_rows":[["1"],["1","2"],["1","6","4"],["1","12","24","8"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A114687"],"derivation":{"root":"n-8ce61d302cec295b","steps":[],"edges":[],"text":"A114687"},"headline":"A114687: 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).","chain":null}},{"id":"l-ae742e91b8115bd3","kind":"fingerprint_related","node_a_id":"n-c3c79310b753c17e","node_b_id":"n-590c95f2c42d67c1","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-c3c79310b753c17e","other":{"id":"n-c3c79310b753c17e","name":"reversal 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).","first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","6","4"]],"card_rows":[["1"],["1","2"],["1","6","4"],["1","12","24","8"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["reverse"],"edges":["e-87267df0bda73e27"],"text":"A114656 \u2192 reverse"},"headline":"A114656 \u2192 reverse","chain":null}},{"id":"l-aed01a1428afc547","kind":"fingerprint_related","node_a_id":"n-590c95f2c42d67c1","node_b_id":"n-0d9e1f9107b2993a","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-0d9e1f9107b2993a","other":{"id":"n-0d9e1f9107b2993a","name":"derivative of theta_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["4"],["24","12"]],"card_rows":[["4"],["24","12"],["96","144","24"],["320","960","480","40"]],"row_sums_preview":["0","4","36","264","1800","11820","75852","479248"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1","D"],"edges":["e-d14d9d630db1a5b2","e-922c5273412daf9f"],"text":"A114655 \u2192 \u03b8+1 \u2192 D"},"headline":"A114655 \u2192 \u03b8+1 \u2192 D","chain":null}},{"id":"l-f01521d6fd80ba0b","kind":"fingerprint_related","node_a_id":"n-1b0fc3e5a40ede1a","node_b_id":"n-590c95f2c42d67c1","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-1b0fc3e5a40ede1a","other":{"id":"n-1b0fc3e5a40ede1a","name":"reversal 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).","first_index":0,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["4","6","1"]],"card_rows":[["1"],["2","1"],["4","6","1"],["8","24","12","1"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["reverse"],"edges":["e-0ad5e2ffb4ffd4ba"],"text":"A114687 \u2192 reverse"},"headline":"A114687 \u2192 reverse","chain":null}},{"id":"l-f23667c102e1d73c","kind":"fingerprint_related","node_a_id":"n-6a30765140629bd5","node_b_id":"n-590c95f2c42d67c1","fingerprint":"f6-9e57d05d9d9a1ce7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9e57d05d9d9a1ce7"},"other_id":"n-6a30765140629bd5","other":{"id":"n-6a30765140629bd5","name":"Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["4","2"],["8","12","2"]],"card_rows":[["2"],["4","2"],["8","12","2"],["16","48","24","2"]],"row_sums_preview":["2","6","22","90","394","1806","8558","41586"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A114655"],"derivation":{"root":"n-6a30765140629bd5","steps":[],"edges":[],"text":"A114655"},"headline":"A114655: Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","chain":null}}],"oeis":[],"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:   0;\n  1:   4;\n  2:  12,    24;\n  3:  24,   144,     96;\n  4:  40,   480,    960,     320;\n  5:  60,  1200,   4800,    4800,     960;\n  6:  84,  2520,  16800,   33600,   20160,    2688;\n  7: 112,  4704,  47040,  156800,  188160,   75264,    7168;\n  8: 144,  8064, 112896,  564480, 1128960,  903168,  258048,  18432;\n  9: 180, 12960, 241920, 1693440, 5080320, 6773760, 3870720, 829440, 46080;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (n+1+(6*n-6)*x)*P(n-1,x) + (2*x-4*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 4;\nP[n_, x_] := P[n, x] = Expand[Together[((n + 1 + (6*n - 6)*x)*P[n - 1, x] + (2*x - 4*x^2)*D[P[n - 1, x], x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 4; for(n = 2, N, my(i = n + 1); v[i] = ((n + 1 + (6*n - 6)*x)*v[i - 1] + (2*x - 4*x^2)*deriv(v[i - 1], x))/(n - 1)); 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":["\u03b8+1","D"],"edges":["e-2a32d110f0351649","e-864f23aa09e283a6"],"text":"A114687 \u2192 \u03b8+1 \u2192 D"},"headline":"A114687 \u2192 \u03b8+1 \u2192 D","chain":null}