{"id":"n-694017a14c5c1f2e","revision":1,"first_index":0,"fingerprint":"f6-3d0fbbfa79b3fd61","name":"Triangle read by rows, T(n,k) = (k+1)*(n+1)!*(n+k)!/((k+1)!^2*(n-k)!) with n >= 0 and 0 <= k <= n.","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","2"],["6","18","12"],["24","144","240","120"],["120","1200","3600","4200","1680"],["720","10800","50400","100800","90720","30240"],["5040","105840","705600","2116800","3175200","2328480","665280"],["40320","1128960","10160640","42336000","93139200","111767040","69189120","17297280"],["362880","13063680","152409600","838252800","2514758400","4358914560","4358914560","2335132800","518918400"],["3628800","163296000","2395008000","16765056000","65383718400","152562009600","217945728000","186810624000","88216128000","17643225600"],["39916800","2195424000","39517632000","342486144000","1678182105600","5034546316800","9589612032000","11644528896000","8733396672000","3687434150400","670442572800"],["479001600","31614105600","684972288000","7192209024000","43153254144000","161105482137600","391256170905600","628804560384000","663738147072000","442492098048000","168951528345600","28158588057600"],["6227020800","485707622400","12466495641600","155831195520000","1121984607744000","5086330221772800","15258990665318400","31062945282969600","43142979559680000","40266780922368000","24160068553420800","8419417829222400","1295295050649600"],["87178291200","7933224499200","237996734976000","3490618779648000","29670259627008000","160219401985843200","579841645282099200","1449604113205248000","2536807198109184000","3100542131022336000","2593180691400499200","1414462195309363200","453353267727360000","64764752532480000"],["1307674368000","137305808640000","4759934699520000","80918889891840000","801097009929216000","5073614396218368000","21744061698078720000","65232185094236160000","139524395896005120000","213937407040541184000","233386262226044928000","176807774413670400000","88403887206835200000","26229724775654400000","3497296636753920000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","36","528","10800","283680","9102240","345058560","15090727680","747888422400","41422381862400","2535569103513600","169983582318950400","12386182292118835200","974723523832041984000"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A253284","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-2"],["2","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0"],["2"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169761,"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":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-43104b4ad89dd272","e-90d2a571e7c69693"]},{"id":169762,"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-43104b4ad89dd272","e-90d2a571e7c69693"]},{"id":169763,"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-43104b4ad89dd272","e-90d2a571e7c69693"]},{"id":169764,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-43104b4ad89dd272"]}],"region_exact":{},"incoming_edges":[{"id":"e-43104b4ad89dd272","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-694017a14c5c1f2e","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"5d175203c0ed6f89eae3eec57e7746e06a5fe1530228f0a8cd58e603cbaac0de","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":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-90d2a571e7c69693","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-694017a14c5c1f2e","premise_count":0,"theorem":"Row-hypergeometric rows: an exact row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, proved for every n by an invariant row-annihilator system of the rule, writes every row as U_0(n) x^v (or its reversal) times the image of (1 + x)^M(n) under a product of nonnegative multiplier sequences: C^k (C > 0); k -> M'!/(M' - k)!, whose exponential generating function is (1 + x)^M' (Polya--Schur, Theorem 7.1 (3) => (1) of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601: a sequence is a multiplier sequence when G(x) = sum_k lambda_k x^k / k! or G(-x) can be written C x^m e^(a x) prod_k (1 + alpha_k x) with a >= 0, alpha_k >= 0); k -> phi(k) for a polynomial phi with only real roots, all <= 0 (Laguerre's theorem, RealRooted isPFMultiplierSequence_eval_of_roots_nonpos); k -> 1/(alpha)_k for alpha > 0 (RealRooted isPFMultiplierSequence_inv_ascPochhammer, via the generalized Laguerre polynomials); products of PF multiplier sequences are PF multiplier sequences (RealRooted IsPFMultiplierSequence.mul) and map real-rooted polynomials with nonnegative coefficients to such polynomials (IsPFMultiplierSequence.diagonalOperator_isPF)","lean_route":null,"lean_declarations":["RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_inv_ascPochhammer","RealRooted.IsPFMultiplierSequence.mul","RealRooted.IsPFMultiplierSequence.diagonalOperator_isPF"],"certificate_hash":"0f57ef85a7d8f5dbdddca7ef7b933c15942ee7aa697180d044eb2b414c6c6738","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-87a6e1a3ad32d94d","kind":"fingerprint_related","node_a_id":"n-be392fc9b98fb771","node_b_id":"n-694017a14c5c1f2e","fingerprint":"f6-3d0fbbfa79b3fd61","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3d0fbbfa79b3fd61"},"other_id":"n-be392fc9b98fb771","other":{"id":"n-be392fc9b98fb771","name":"Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.","first_index":1,"fingerprint":"f6-3d0fbbfa79b3fd61","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","3","2"]],"card_rows":[["1"],["1","1"],["1","3","2"],["1","6","10","5"]],"row_sums_preview":["1","2","6","22","90","394","1806","8558"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":["A088617"],"derivation":{"root":"n-be392fc9b98fb771","steps":[],"edges":[],"text":"A088617"},"headline":"A088617: Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.","chain":null}},{"id":"l-018c1e33d4802b52","kind":"oeis_match","node_a_id":"n-694017a14c5c1f2e","node_b_id":null,"fingerprint":null,"oeis_id":"A052716","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":14},"in_catalog":false,"oeis_id":"A052716","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a672250c3dee1d67","kind":"oeis_match","node_a_id":"n-694017a14c5c1f2e","node_b_id":null,"fingerprint":null,"oeis_id":"A253284","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":36},"in_catalog":true,"oeis_id":"A253284","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A253284","relation":"identification"},{"oeis_id":"A052716","relation":"match_row_sums"},{"oeis_id":"A253284","relation":"match_triangle"}],"bfiles":[{"node_id":"n-694017a14c5c1f2e","oeis_id":"A253284","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":36,"oeis_terms_agreeing":36,"oeis_terms_available":36,"term_count":990,"raw_size":52160}],"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,         2;\n  2:       6,        18,         12;\n  3:      24,       144,        240,         120;\n  4:     120,      1200,       3600,        4200,        1680;\n  5:     720,     10800,      50400,      100800,       90720,        30240;\n  6:    5040,    105840,     705600,     2116800,     3175200,      2328480,       665280;\n  7:   40320,   1128960,   10160640,    42336000,    93139200,    111767040,     69189120,     17297280;\n  8:  362880,  13063680,  152409600,   838252800,  2514758400,   4358914560,   4358914560,   2335132800,   518918400;\n  9: 3628800, 163296000, 2395008000, 16765056000, 65383718400, 152562009600, 217945728000, 186810624000, 88216128000, 17643225600;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1+(4*n-2)*x)*P(n-1,x) - (n^2-2*n)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[n_, x_] := P[n, x] = Expand[(2*n - 1 + (4*n - 2)*x)*P[n - 1, x] - (n^2 - 2*n)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 1 + (4*n - 2)*x)*v[i - 1] - (n^2 - 2*n)*v[i - 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":"A253284","target":"triangle","first_row":0,"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:       2,         2;\n  2:       6,        18,         12;\n  3:      24,       144,        240,         120;\n  4:     120,      1200,       3600,        4200,        1680;\n  5:     720,     10800,      50400,      100800,       90720,        30240;\n  6:    5040,    105840,     705600,     2116800,     3175200,      2328480,       665280;\n  7:   40320,   1128960,   10160640,    42336000,    93139200,    111767040,     69189120,     17297280;\n  8:  362880,  13063680,  152409600,   838252800,  2514758400,   4358914560,   4358914560,   2335132800,   518918400;\n  9: 3628800, 163296000, 2395008000, 16765056000, 65383718400, 152562009600, 217945728000, 186810624000, 88216128000, 17643225600;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1+(4*n-2)*x)*P(n-1,x) - (n^2-2*n)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[n_, x_] := P[n, x] = Expand[(2*n - 1 + (4*n - 2)*x)*P[n - 1, x] - (n^2 - 2*n)*P[n - 2, x]];\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] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 1 + (4*n - 2)*x)*v[i - 1] - (n^2 - 2*n)*v[i - 2]); 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":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-694017a14c5c1f2e","steps":[],"edges":[],"text":"A253284"},"headline":"A253284: Triangle read by rows, T(n,k) = (k+1)*(n+1)!*(n+k)!/((k+1)!^2*(n-k)!) with n >= 0 and 0 <= k <= n.","chain":null}