{"id":"n-57b4b14604f4c0d7","revision":3,"first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","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).","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"],["2","1"],["5","5","1"],["14","21","9","1"],["42","84","56","14","1"],["132","330","300","120","20","1"],["429","1287","1485","825","225","27","1"],["1430","5005","7007","5005","1925","385","35","1"],["4862","19448","32032","28028","14014","4004","616","44","1"],["16796","75582","143208","148512","91728","34398","7644","936","54","1"],["58786","293930","629850","755820","556920","259896","76440","13650","1365","65","1"],["208012","1144066","2735810","3730650","3197700","1790712","659736","157080","23100","1925","77","1"],["742900","4457400","11767536","17978180","17587350","11511720","5116320","1534896","302940","37400","2640","90","1"],["2674440","17383860","50220040","84987760","93486536","70114902","36581688","13302432","3325608","554268","58344","3536","104","1"],["9694845","67863915","212952285","395482815","483367885","409003595","245402157","105172353","32008977","6789783","969969","88179","4641","119","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","11","45","197","903","4279","20793","103049","518859","2646723","13648869","71039373","372693519","1968801519"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A126216","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","1"],["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":"e-14ec8c56d64bb491","recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"],["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":2,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":"e-e1afdf3c1fb62188","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","0"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159186,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-eeaae8f0048b4b45"]},{"id":159187,"position":1,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"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-b83534d04d299e48"]},{"id":159188,"position":2,"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-57f57afe27d03083","e-5fe7e1b16eb84690","e-b83534d04d299e48","e-ba4d874222d3ab4e"]},{"id":159189,"position":3,"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-57f57afe27d03083","e-5fe7e1b16eb84690","e-b83534d04d299e48","e-ba4d874222d3ab4e"]},{"id":159190,"position":4,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-b83534d04d299e48"]},{"id":159191,"position":5,"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-5fe7e1b16eb84690","e-ba4d874222d3ab4e"]},{"id":159192,"position":6,"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-57f57afe27d03083","e-5fe7e1b16eb84690"]},{"id":159193,"position":7,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-57f57afe27d03083"]}],"region_exact":{},"incoming_edges":[{"id":"e-5fe7e1b16eb84690","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-57b4b14604f4c0d7","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":"28d1b4ae5df1fe3d8facd7a0658af382cbd62f03cc99d8678d15cb7a206e419b","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-c2eaf5212a4dec13","role":"sequence","name":"Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.","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-14ec8c56d64bb491","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-57b4b14604f4c0d7","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"c0c4da096dd95d17e27ecf69051a9028c9fee36c60b3a82ce77e4b4e72aa6769","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-e1afdf3c1fb62188","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-57b4b14604f4c0d7","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"1df16380fe81b8afbb380afa2f978ba952261d4d3fc61989eff27d1e16a351c7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-57f57afe27d03083","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-57b4b14604f4c0d7","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":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"13b1aee6d4c0b175802f13fd4cdaf2f7439548379c84e452f070283a32652405","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-c2eaf5212a4dec13","role":"sequence","name":"Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.","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-ba4d874222d3ab4e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-57b4b14604f4c0d7","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":"65f857df20440536498e408f2bb192d15cc8a069d8a32c0b2832bf814a484688","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-66e2c3448245b0b7","role":"sequence","name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","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-b83534d04d299e48","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-57b4b14604f4c0d7","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"237cd1f4e287caa0baf39f1b0c2f41dcf8a16ef78d840e307f0b8df178a889f6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-eeaae8f0048b4b45","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-57b4b14604f4c0d7","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"dfcda1b0d502d91e2bf887cfef97fb5977cc8ffa57fdeff22883a5e7c408f845","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[]}],"used_by":[{"id":"e-3c8d43f1dfa996d6","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-83e32d0bc1c10d45","conclusion_name":"basis_map_A007318 of 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)."},{"id":"e-452beb3fe1708cbf","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-146d64c3583c8509","conclusion_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)."},{"id":"e-51c23bff4d2cb648","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-cbba416b5dae7a51","conclusion_name":"basis_map_A013610 of 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)."},{"id":"e-beda254f8b34ffbd","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-b6cda967a092feb1","conclusion_name":"basis_map_A007318 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)."},{"id":"e-e359b7b7523058b5","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-18d7f5d66e818954","conclusion_name":"basis_map_A008277 of 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)."},{"id":"e-38a5f21f7e3f9e41","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-ff3f26cc45b3d80a","conclusion_name":"mobius_x_over_x_plus_one of 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)."},{"id":"e-3adfaf26de79e7ad","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-66e2c3448245b0b7","conclusion_name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions."},{"id":"e-49264023c59aa288","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-b9bc007ee70c2496","conclusion_name":"one_plus_derivative of 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)."},{"id":"e-50516f7b15ad2326","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-7b12f0dd728288ea","conclusion_name":"theta_plus_one of 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)."},{"id":"e-556b2ae7482db11d","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-83e32d0bc1c10d45","conclusion_name":"basis_map_A007318 of 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)."},{"id":"e-a4f714b61c97080d","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-3e16b3cbabac7254","conclusion_name":"derivative of 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)."},{"id":"e-e07ba370ee736991","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-d2911c15cf811244","conclusion_name":"theta_plus_one_squared of 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)."}],"used_by_total":12,"links":[{"id":"l-297fecb4da7e3e53","kind":"fingerprint_related","node_a_id":"n-57b4b14604f4c0d7","node_b_id":"n-4d61144188f12208","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-4d61144188f12208","other":{"id":"n-4d61144188f12208","name":"mobius_x_over_x_plus_one of narayana","first_index":1,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","5","5"]],"card_rows":[["1"],["1","2"],["1","5","5"],["1","9","21","14"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-2a05d8340c329b21","steps":["x \u21a6 x/(x+1)"],"edges":["e-50c973bfb8d0ccf1"],"text":"narayana \u2192 x \u21a6 x/(x+1)"},"headline":"narayana \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-4ccc0f53e29ee73e","kind":"fingerprint_related","node_a_id":"n-57b4b14604f4c0d7","node_b_id":"n-6f30da2298fd30ba","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-6f30da2298fd30ba","other":{"id":"n-6f30da2298fd30ba","name":"basis_map_A007318 of narayana","first_index":1,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["5","5","1"]],"card_rows":[["1"],["2","1"],["5","5","1"],["14","21","9","1"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-2a05d8340c329b21","steps":["basis A007318"],"edges":["e-58b8cdf8af6ac600"],"text":"narayana \u2192 basis A007318"},"headline":"narayana \u2192 basis A007318","chain":null}},{"id":"l-57d80fe667bbba8c","kind":"fingerprint_related","node_a_id":"n-57b4b14604f4c0d7","node_b_id":"n-00a555c278779f26","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-00a555c278779f26","other":{"id":"n-00a555c278779f26","name":"shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","2"],["15","15","3"]],"card_rows":[["1"],["4","2"],["15","15","3"],["56","84","36","4"]],"row_sums_preview":["1","6","33","180","985","5418","29953","166344"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-984320118b653f6b","steps":["x \u21a6 x+1"],"edges":["e-f4ea45816c9a82eb"],"text":"A132812 \u2192 x \u21a6 x+1"},"headline":"A132812 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-a1eb46f23fa2f474","kind":"fingerprint_related","node_a_id":"n-57b4b14604f4c0d7","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-68cd61e91317cdaa","other":{"id":"n-68cd61e91317cdaa","name":"derivative of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","first_index":1,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["2"],["6","12"]],"card_rows":[["2"],["6","12"],["12","60","60"],["20","180","420","280"]],"row_sums_preview":["0","2","18","132","900","5910","37926","239624"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4689fb1386d440ad","steps":["D"],"edges":["e-ab4d580ed9bca928"],"text":"A063007 \u2192 D"},"headline":"A063007 \u2192 D","chain":null}},{"id":"l-c98cd5c98ca1119e","kind":"fingerprint_related","node_a_id":"n-66e2c3448245b0b7","node_b_id":"n-57b4b14604f4c0d7","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-66e2c3448245b0b7","other":{"id":"n-66e2c3448245b0b7","name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","5","5"]],"card_rows":[["1"],["1","2"],["1","5","5"],["1","9","21","14"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, +inf)","(-inf, 0)","(-1, 0)","[-1, 0]","(-inf, 0]"],"region_exact":{},"oeis_ids":["A033282"],"derivation":{"root":"n-66e2c3448245b0b7","steps":[],"edges":[],"text":"A033282"},"headline":"A033282: Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","chain":null}},{"id":"l-e8fdee51edea565c","kind":"fingerprint_related","node_a_id":"n-57b4b14604f4c0d7","node_b_id":"n-b2e66fb8e43e7448","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-b2e66fb8e43e7448","other":{"id":"n-b2e66fb8e43e7448","name":"mobius_x_over_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","4"],["3","15","15"]],"card_rows":[["1"],["2","4"],["3","15","15"],["4","36","84","56"]],"row_sums_preview":["1","6","33","180","985","5418","29953","166344"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-984320118b653f6b","steps":["x \u21a6 x/(x+1)"],"edges":["e-6a8f8db3c1596aaf"],"text":"A132812 \u2192 x \u21a6 x/(x+1)"},"headline":"A132812 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-9b5c0720917a142c","kind":"oeis_match","node_a_id":"n-57b4b14604f4c0d7","node_b_id":null,"fingerprint":null,"oeis_id":"A033282","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":3,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A033282","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-ab46dcd6702954df","kind":"oeis_match","node_a_id":"n-57b4b14604f4c0d7","node_b_id":null,"fingerprint":null,"oeis_id":"A126216","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A126216","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-ff657cc18bb489c7","kind":"oeis_match","node_a_id":"n-57b4b14604f4c0d7","node_b_id":null,"fingerprint":null,"oeis_id":"A001003","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":"A001003","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A126216","relation":"identification"},{"oeis_id":"A033282","relation":"match_reversed_triangle"},{"oeis_id":"A001003","relation":"match_row_sums"},{"oeis_id":"A126216","relation":"match_triangle"}],"bfiles":[{"node_id":"n-57b4b14604f4c0d7","oeis_id":"A033282","target":"reversed_triangle","oeis_offset":3,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":19978},{"node_id":"n-57b4b14604f4c0d7","oeis_id":"A126216","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":19974}],"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:     2,     1;\n  2:     5,     5,      1;\n  3:    14,    21,      9,      1;\n  4:    42,    84,     56,     14,     1;\n  5:   132,   330,    300,    120,    20,     1;\n  6:   429,  1287,   1485,    825,   225,    27,    1;\n  7:  1430,  5005,   7007,   5005,  1925,   385,   35,   1;\n  8:  4862, 19448,  32032,  28028, 14014,  4004,  616,  44,  1;\n  9: 16796, 75582, 143208, 148512, 91728, 34398, 7644, 936, 54, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = (4*n+2+(2*n+1)*x)*P(n-1,x) - (n-1)*x^2*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n + 2 + (2*n + 1)*x)*P[n - 1, x] - (n - 1)*x^2*P[n - 2, 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] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n + 2 + (2*n + 1)*x)*v[i - 1] - (n - 1)*x^2*v[i - 2])/(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}},{"oeis_id":"A033282","target":"reversed_triangle","first_row":0,"oeis_offset":3,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   3: 1;\n   4: 1,  2;\n   5: 1,  5,   5;\n   6: 1,  9,  21,   14;\n   7: 1, 14,  56,   84,    42;\n   8: 1, 20, 120,  300,   330,   132;\n   9: 1, 27, 225,  825,  1485,  1287,    429;\n  10: 1, 35, 385, 1925,  5005,  7007,   5005,   1430;\n  11: 1, 44, 616, 4004, 14014, 28028,  32032,  19448,  4862;\n  12: 1, 54, 936, 7644, 34398, 91728, 148512, 143208, 75582, 16796;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (4*n-10+(2*n-5)*x)*P(n-1,x) - (n-4)*x^2*P(n-2,x) for n >= 5, with P(3,x) = 1, P(4,x) = 2 + x.","mathematica":"P[3, x_] := 1;\nP[4, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n - 10 + (2*n - 5)*x)*P[n - 1, x] - (n - 4)*x^2*P[n - 2, x])/(n - 1)]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n - 2]], {n, 3, 12}] // Flatten","pari":"P(N) = {my(v = vector(N - 2)); v[1] = 1; v[2] = 2 + x; for(n = 5, N, my(i = n - 2); v[i] = ((4*n - 10 + (2*n - 5)*x)*v[i - 1] - (n - 4)*x^2*v[i - 2])/(n - 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - 2 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 2, v[i])))};\nT(12)","reading":{"first_row":0,"offset":3,"reversed":true,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A126216","target":"triangle","first_row":0,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:     1;\n   2:     2,     1;\n   3:     5,     5,      1;\n   4:    14,    21,      9,      1;\n   5:    42,    84,     56,     14,     1;\n   6:   132,   330,    300,    120,    20,     1;\n   7:   429,  1287,   1485,    825,   225,    27,    1;\n   8:  1430,  5005,   7007,   5005,  1925,   385,   35,   1;\n   9:  4862, 19448,  32032,  28028, 14014,  4004,  616,  44,  1;\n  10: 16796, 75582, 143208, 148512, 91728, 34398, 7644, 936, 54, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = (4*n-2+(2*n-1)*x)*P(n-1,x) - (n-2)*x^2*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n - 2 + (2*n - 1)*x)*P[n - 1, x] - (n - 2)*x^2*P[n - 2, x])/(n + 1)]];\nTable[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + x; for(n = 3, N, my(i = n); v[i] = ((4*n - 2 + (2*n - 1)*x)*v[i - 1] - (n - 2)*x^2*v[i - 2])/(n + 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":0,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-57b4b14604f4c0d7","steps":[],"edges":[],"text":"A126216"},"headline":"A126216: 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).","chain":null}