{"id":"n-b1b19325e0094118","revision":1,"first_index":0,"fingerprint":"f6-4b23e46a501a23b5","name":"Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","2"],["1","6","3"],["1","12","18","4"],["1","20","60","40","5"],["1","30","150","200","75","6"],["1","42","315","700","525","126","7"],["1","56","588","1960","2450","1176","196","8"],["1","72","1008","4704","8820","7056","2352","288","9"],["1","90","1620","10080","26460","31752","17640","4320","405","10"],["1","110","2475","19800","69300","116424","97020","39600","7425","550","11"],["1","132","3630","36300","163350","365904","426888","261360","81675","12100","726","12"],["1","156","5148","62920","353925","1019304","1585584","1359072","637065","157300","18876","936","13"],["1","182","7098","104104","715715","2576574","5153148","5889312","3864861","1431430","286286","28392","1183","14"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","3","10","35","126","462","1716","6435","24310","92378","352716","1352078","5200300","20058300"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A367270","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-3"],["2"]]},"terms":[{"coeff":{"coeffs":[["2","4"],["-8","-8"],["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","4","-2"],["5","-10","5"],["-2","4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159938,"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-30d8fbe7ca664c09"]},{"id":159939,"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-2b43df6c63e34146"]},{"id":159940,"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-2b43df6c63e34146"]},{"id":159941,"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-2b43df6c63e34146"]},{"id":159942,"position":4,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-2b43df6c63e34146"]}],"region_exact":{},"incoming_edges":[{"id":"e-2b43df6c63e34146","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-b1b19325e0094118","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":"c08b6ba0e431269f53733ea682207cf4bfbdbc09931df39a2ba084ef8b03e4c3","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-30d8fbe7ca664c09","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-b1b19325e0094118","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":"5876e7c7b350d1610151cd5220c85fad3fc565b75418d350675a18c02cc50f06","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[]}],"used_by":[{"id":"e-169cfb9127a1a777","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-3897d3bccfbe11da","conclusion_name":"basis_map_A013609 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-59715d0ff282a908","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-bf08de87964eed6e","conclusion_name":"basis_map_A013610 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-9efc939e395fae07","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-c2b0d68b9e568dde","conclusion_name":"basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-a70bef035c61e98a","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-b8e11e765570cb44","conclusion_name":"basis_map_A013611 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-f7f7b35ffa4336f4","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-0138853f54741ca2","conclusion_name":"basis_map_A008277 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-0b4e20b8d0434aa5","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-9e1ed0ca437bb5b8","conclusion_name":"theta_plus_one_squared of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-2f63263d248c26b4","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-4ea7eb31fd1a1554","conclusion_name":"derivative of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-5e9a418c539b3915","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-c2b0d68b9e568dde","conclusion_name":"basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-65f24507891d8ee5","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-d55989cf30fde6ff","conclusion_name":"theta_plus_one of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},{"id":"e-9d22aaa3a73f8d2e","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-6df635aa2e27e944","conclusion_name":"one_plus_derivative of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."}],"used_by_total":10,"links":[{"id":"l-064c2c61ec17cef7","kind":"fingerprint_related","node_a_id":"n-b1b19325e0094118","node_b_id":"n-16e42f812cdd0509","fingerprint":"f6-4b23e46a501a23b5","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4b23e46a501a23b5"},"other_id":"n-16e42f812cdd0509","other":{"id":"n-16e42f812cdd0509","name":"theta_plus_one of 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.","first_index":0,"fingerprint":"f6-4b23e46a501a23b5","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","6","3"]],"card_rows":[["1"],["1","2"],["1","6","3"],["1","12","18","4"]],"row_sums_preview":["1","3","10","35","126","462","1716","6435"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c2eaf5212a4dec13","steps":["\u03b8+1"],"edges":["e-d2a71b42a97e9c64"],"text":"A001263 \u2192 \u03b8+1"},"headline":"A001263 \u2192 \u03b8+1","chain":null}},{"id":"l-5a69faef77c6dc85","kind":"fingerprint_related","node_a_id":"n-b1b19325e0094118","node_b_id":"n-aff68976ca55ced5","fingerprint":"f6-4b23e46a501a23b5","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4b23e46a501a23b5"},"other_id":"n-aff68976ca55ced5","other":{"id":"n-aff68976ca55ced5","name":"derivative of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-4b23e46a501a23b5","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["4","2"]],"card_rows":[["1"],["4","2"],["9","18","3"],["16","72","48","4"]],"row_sums_preview":["0","1","6","30","140","630","2772","12012"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["D"],"edges":["e-c979375bc9c35b2c"],"text":"A008459 \u2192 D"},"headline":"A008459 \u2192 D","chain":null}},{"id":"l-90204f927aabe604","kind":"fingerprint_related","node_a_id":"n-b1b19325e0094118","node_b_id":"n-afe255891f244593","fingerprint":"f6-4b23e46a501a23b5","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4b23e46a501a23b5"},"other_id":"n-afe255891f244593","other":{"id":"n-afe255891f244593","name":"theta_plus_one of narayana","first_index":1,"fingerprint":"f6-4b23e46a501a23b5","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","6","3"]],"card_rows":[["1"],["1","2"],["1","6","3"],["1","12","18","4"]],"row_sums_preview":["1","3","10","35","126","462","1716","6435"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-2a05d8340c329b21","steps":["\u03b8+1"],"edges":["e-0a91669a22bbc945"],"text":"narayana \u2192 \u03b8+1"},"headline":"narayana \u2192 \u03b8+1","chain":null}},{"id":"l-342cbc01d3c602d9","kind":"oeis_match","node_a_id":"n-b1b19325e0094118","node_b_id":null,"fingerprint":null,"oeis_id":"A088218","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":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A088218","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-47bf6e0e04d2e3b6","kind":"oeis_match","node_a_id":"n-b1b19325e0094118","node_b_id":null,"fingerprint":null,"oeis_id":"A001700","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":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A001700","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-7fe4d358154f2d4e","kind":"oeis_match","node_a_id":"n-b1b19325e0094118","node_b_id":null,"fingerprint":null,"oeis_id":"A103371","in_catalog":0,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":60},"in_catalog":false,"oeis_id":"A103371","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-cbe5e1ba5fd72c18","kind":"oeis_match","node_a_id":"n-b1b19325e0094118","node_b_id":null,"fingerprint":null,"oeis_id":"A132813","in_catalog":0,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":false,"oeis_id":"A132813","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A367270","relation":"identification"},{"oeis_id":"A103371","relation":"match_reversed_triangle"},{"oeis_id":"A001700","relation":"match_row_sums"},{"oeis_id":"A088218","relation":"match_row_sums"},{"oeis_id":"A132813","relation":"match_triangle"}],"bfiles":[{"node_id":"n-b1b19325e0094118","oeis_id":"A001700","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":26,"oeis_terms_available":26,"term_count":200,"raw_size":12798},{"node_id":"n-b1b19325e0094118","oeis_id":"A088218","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":27,"oeis_terms_available":27,"term_count":200,"raw_size":12680},{"node_id":"n-b1b19325e0094118","oeis_id":"A103371","target":"reversed_triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":60,"oeis_terms_agreeing":60,"oeis_terms_available":60,"term_count":990,"raw_size":16329},{"node_id":"n-b1b19325e0094118","oeis_id":"A132813","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":16329}],"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: 1;\n  2: 1,  2;\n  3: 1,  6,    3;\n  4: 1, 12,   18,    4;\n  5: 1, 20,   60,   40,    5;\n  6: 1, 30,  150,  200,   75,    6;\n  7: 1, 42,  315,  700,  525,  126,    7;\n  8: 1, 56,  588, 1960, 2450, 1176,  196,   8;\n  9: 1, 72, 1008, 4704, 8820, 7056, 2352, 288, 9;\n","recurrence_sentence":"The row polynomials satisfy (2*n^2-3*n)*P(n,x) = (4*n^2-8*n+2+(4*n^2-8*n+4)*x)*P(n-1,x) - (2*n^2-5*n+2-(4*n^2-10*n+4)*x+(2*n^2-5*n+2)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 8*n + 2 + (4*n^2 - 8*n + 4)*x)*P[n - 1, x] - (2*n^2 - 5*n + 2 - (4*n^2 - 10*n + 4)*x + (2*n^2 - 5*n + 2)*x^2)*P[n - 2, x])/(2*n^2 - 3*n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((4*n^2 - 8*n + 2 + (4*n^2 - 8*n + 4)*x)*v[i - 1] - (2*n^2 - 5*n + 2 - (4*n^2 - 10*n + 4)*x + (2*n^2 - 5*n + 2)*x^2)*v[i - 2])/(2*n^2 - 3*n)); 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":"A103371","target":"reversed_triangle","first_row":1,"oeis_offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  1;\n  1:  2,   1;\n  2:  3,   6,    1;\n  3:  4,  18,   12,     1;\n  4:  5,  40,   60,    20,     1;\n  5:  6,  75,  200,   150,    30,     1;\n  6:  7, 126,  525,   700,   315,    42,     1;\n  7:  8, 196, 1176,  2450,  1960,   588,    56,    1;\n  8:  9, 288, 2352,  7056,  8820,  4704,  1008,   72,  1;\n  9: 10, 405, 4320, 17640, 31752, 26460, 10080, 1620, 90, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (2*n^2+n-1)*P(n,x) = (4*n^2-2+4*n^2*x)*P(n-1,x) - (2*n^2-n-1-(4*n^2-2*n-2)*x+(2*n^2-n-1)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 2 + 4*n^2*x)*P[n - 1, x] - (2*n^2 - n - 1 - (4*n^2 - 2*n - 2)*x + (2*n^2 - n - 1)*x^2)*P[n - 2, x])/(2*n^2 + n - 1)]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n^2 - 2 + 4*n^2*x)*v[i - 1] - (2*n^2 - n - 1 - (4*n^2 - 2*n - 2)*x + (2*n^2 - n - 1)*x^2)*v[i - 2])/(2*n^2 + n - 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":1,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A132813","target":"triangle","first_row":1,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1,  2;\n  2: 1,  6,    3;\n  3: 1, 12,   18,     4;\n  4: 1, 20,   60,    40,     5;\n  5: 1, 30,  150,   200,    75,     6;\n  6: 1, 42,  315,   700,   525,   126,     7;\n  7: 1, 56,  588,  1960,  2450,  1176,   196,    8;\n  8: 1, 72, 1008,  4704,  8820,  7056,  2352,  288,   9;\n  9: 1, 90, 1620, 10080, 26460, 31752, 17640, 4320, 405, 10;\n","recurrence_sentence":"The row polynomials satisfy (2*n^2+n-1)*P(n,x) = (4*n^2-2+4*n^2*x)*P(n-1,x) - (2*n^2-n-1-(4*n^2-2*n-2)*x+(2*n^2-n-1)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 2 + 4*n^2*x)*P[n - 1, x] - (2*n^2 - n - 1 - (4*n^2 - 2*n - 2)*x + (2*n^2 - n - 1)*x^2)*P[n - 2, x])/(2*n^2 + n - 1)]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n^2 - 2 + 4*n^2*x)*v[i - 1] - (2*n^2 - n - 1 - (4*n^2 - 2*n - 2)*x + (2*n^2 - n - 1)*x^2)*v[i - 2])/(2*n^2 + n - 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":1,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-b1b19325e0094118","steps":[],"edges":[],"text":"A367270"},"headline":"A367270: Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).","chain":null}