{"id":"n-435b4d5bded8f11f","revision":1,"first_index":1,"fingerprint":"f6-9e57d05d9d9a1ce7","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.","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":[["2"],["2","4"],["2","12","8"],["2","24","48","16"],["2","40","160","160","32"],["2","60","400","800","480","64"],["2","84","840","2800","3360","1344","128"],["2","112","1568","7840","15680","12544","3584","256"],["2","144","2688","18816","56448","75264","43008","9216","512"],["2","180","4320","40320","169344","338688","322560","138240","23040","1024"],["2","220","6600","79200","443520","1241856","1774080","1267200","422400","56320","2048"],["2","264","9680","145200","1045440","3902976","7805952","8363520","4646400","1239040","135168","4096"],["2","312","13728","251680","2265120","10872576","28993536","43490304","36241920","16107520","3514368","319488","8192"],["2","364","18928","416416","4580576","27483456","94228992","188457984","219867648","146578432","53301248","9691136","745472","16384"],["2","420","25480","662480","8744736","64128064","274834560","706717440","1099338240","1026049024","559663104","169594880","26091520","1720320","32768"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","6","22","90","394","1806","8558","41586","206098","1037718","5293446","27297738","142078746","745387038","3937603038"],"nonn":true,"definitions":[{"position":0,"source":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"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":165471,"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-b0d131c104e489dd"]},{"id":165472,"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-b0d131c104e489dd"]},{"id":165473,"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-b0d131c104e489dd"]}],"region_exact":{},"incoming_edges":[{"id":"e-b0d131c104e489dd","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-435b4d5bded8f11f","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"fd7bf41b498fdadc55a84174eb215b9df66ea123ad1ae43fc9166203023a5904","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-6a30765140629bd5","role":"sequence","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.","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-0b7f21cb40f6174d","kind":"fingerprint_related","node_a_id":"n-8ce61d302cec295b","node_b_id":"n-435b4d5bded8f11f","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)"],"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-35aedd47ad51ab4e","kind":"fingerprint_related","node_a_id":"n-1b0fc3e5a40ede1a","node_b_id":"n-435b4d5bded8f11f","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-3f37579f19fc2ca9","kind":"fingerprint_related","node_a_id":"n-6a30765140629bd5","node_b_id":"n-435b4d5bded8f11f","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)"],"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}},{"id":"l-6cd99d921c4294a6","kind":"fingerprint_related","node_a_id":"n-c3c79310b753c17e","node_b_id":"n-435b4d5bded8f11f","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-fbde760708cf0a27"],"text":"A114656 \u2192 reverse"},"headline":"A114656 \u2192 reverse","chain":null}},{"id":"l-b92f4239319b079d","kind":"fingerprint_related","node_a_id":"n-0d75f6272d2a2a84","node_b_id":"n-435b4d5bded8f11f","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)"],"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-0aa707af31671405","kind":"oeis_match","node_a_id":"n-435b4d5bded8f11f","node_b_id":null,"fingerprint":null,"oeis_id":"A025240","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A025240","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-80e02b0527461827","kind":"oeis_match","node_a_id":"n-435b4d5bded8f11f","node_b_id":null,"fingerprint":null,"oeis_id":"A006318","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A006318","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-83e768a3f4afda16","kind":"oeis_match","node_a_id":"n-435b4d5bded8f11f","node_b_id":null,"fingerprint":null,"oeis_id":"A155069","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A155069","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f45b6348efc413cc","kind":"oeis_match","node_a_id":"n-435b4d5bded8f11f","node_b_id":null,"fingerprint":null,"oeis_id":"A114655","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":51},"in_catalog":true,"oeis_id":"A114655","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A114655","relation":"match_reversed_triangle"},{"oeis_id":"A006318","relation":"match_row_sums"},{"oeis_id":"A025240","relation":"match_row_sums"},{"oeis_id":"A155069","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-435b4d5bded8f11f","oeis_id":"A114655","target":"reversed_triangle","oeis_offset":1,"first_row":1,"rows_used":44,"terms_matched":51,"oeis_terms_agreeing":51,"oeis_terms_available":51,"term_count":990,"raw_size":19853}],"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: 2;\n   2: 2,   4;\n   3: 2,  12,    8;\n   4: 2,  24,   48,    16;\n   5: 2,  40,  160,   160,     32;\n   6: 2,  60,  400,   800,    480,     64;\n   7: 2,  84,  840,  2800,   3360,   1344,    128;\n   8: 2, 112, 1568,  7840,  15680,  12544,   3584,    256;\n   9: 2, 144, 2688, 18816,  56448,  75264,  43008,   9216,   512;\n  10: 2, 180, 4320, 40320, 169344, 338688, 322560, 138240, 23040, 1024;\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(1,x) = 2.","mathematica":"P[1, x_] := 2;\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, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); 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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A114655","target":"reversed_triangle","first_row":1,"oeis_offset":1,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:    2;\n   2:    4,     2;\n   3:    8,    12,      2;\n   4:   16,    48,     24,      2;\n   5:   32,   160,    160,     40,      2;\n   6:   64,   480,    800,    400,     60,      2;\n   7:  128,  1344,   3360,   2800,    840,     84,     2;\n   8:  256,  3584,  12544,  15680,   7840,   1568,   112,    2;\n   9:  512,  9216,  43008,  75264,  56448,  18816,  2688,  144,   2;\n  10: 1024, 23040, 138240, 322560, 338688, 169344, 40320, 4320, 180, 2;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (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(1,x) = 2.","mathematica":"P[1, x_] := 2;\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[Reverse[PadRight[CoefficientList[P[n, x], x], n]], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); 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 = concat(c, vector(n - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-6a30765140629bd5","steps":["reverse"],"edges":["e-b0d131c104e489dd"],"text":"A114655 \u2192 reverse"},"headline":"A114655 \u2192 reverse","chain":null}