{"id":"n-e18d516553291356","revision":1,"first_index":1,"fingerprint":"f6-d99ad6edcacedc3c","name":"Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2].","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":[["1"],["4","1"],["28","14","1"],["280","210","30","1"],["3640","3640","780","52","1"],["58240","72800","20800","2080","80","1"],["1106560","1659840","592800","79040","4560","114","1"],["24344320","42602560","18258240","3043040","234080","8778","154","1"],["608608000","1217216000","608608000","121721600","11704000","585200","15400","200","1"],["17041024000","38342304000","21909888000","5112307200","589881600","36867600","1293600","25200","252","1"],["528271744000","1320679360000","849008160000","226402176000","30477216000","2285791200","100254000","2604000","39060","310","1"],["17961239296000","49393408064000","35281005760000","10584301728000","1628354112000","142480984800","7498999200","243474000","4869480","57970","374","1"],["664565853952000","1993697561856000","1566476655744000","522158885248000","90373653216000","9037365321600","554925940800","21620491200","540512280","8579560","83028","444","1"],["26582634158080000","86393561013760000","74051623726080000","27152262032896000","5221588852480000","587428745904000","41223069888000","1873775904000","56213277120","1115342800","14391520","115440","520","1"],["1143053268797440000","4000686440791040000","3714923123591680000","1485969249436672000","314339648919296000","39292456114912000","3102036009072000","161144727744000","5640065471040","134287273120","2165923760","23164960","156520","602","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","43","521","8113","154001","3442915","88491173","2568458401","83033591453","2957227344571","114998537345825","4846887070944913","220032252718119401","10701533144929846003"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A290598","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["12","6"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","9"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":170028,"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-184b061b83071f1b"]},{"id":170029,"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-184b061b83071f1b","e-dbf952aa53d3fadc"]},{"id":170030,"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-184b061b83071f1b","e-dbf952aa53d3fadc"]},{"id":170031,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-184b061b83071f1b"]},{"id":170089,"position":4,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"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-dbf952aa53d3fadc"]}],"region_exact":{},"incoming_edges":[{"id":"e-184b061b83071f1b","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-e18d516553291356","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; S_n = A + B D + C D^2 with A = 4 + x, B = 12 + 6 x, C = 9 x: Branden's Weyl step: T = A + B D + C D^2 maps every real-rooted polynomial to a real-rooted polynomial when (i) B^2 - 4 A C >= 0 on the real line, (ii) A strictly interlaces B (deg B = deg A + 1) or strictly alternates left of B (deg B = deg A), with leading coefficients of the same sign when deg A >= 1, and (iii) T(x^k) has degree deg A + k with leading coefficients of one sign for every k >= 0 (P. Branden, Linear transformations preserving the Polya frequency property, Trans. Amer. Math. Soc. 358 (2006), Corollary 3.5); (i) is necessary for a real-rootedness preserver (J. Borcea and P. Branden, Proc. London Math. Soc. 101 (2010), Theorem 1.3); with coefficients of one sign T also keeps every root in (-inf, 0]; a linear operator preserving real-rootedness preserves the alternation of two polynomials (P. Branden, Trans. Amer. Math. Soc. 358 (2006), Corollary 2.5)","lean_route":null,"lean_declarations":[],"certificate_hash":"80cf2b84d2b8d05e672cf4f20b4f0056b6cf838bb65ab86e5e7a1b066fdbc401","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-dbf952aa53d3fadc","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-e18d516553291356","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":"809cf6796173994f8f7e5de248ad5d86bc1fb11b277ed125650fbdba918a83d1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]}],"used_by":[{"id":"e-05741cbe3c335b92","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-ed7f37079a43bdf8","conclusion_name":"theta_plus_one of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2]."},{"id":"e-28b18fa0659c876e","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-0f37266207fa0305","conclusion_name":"mobius_x_over_x_plus_one of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2]."},{"id":"e-2dd7ffd5e041969b","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-b8dd1392a9092a24","conclusion_name":"reversal of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2]."},{"id":"e-7e2520d42818eaf0","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-931e17ea71b7d537","conclusion_name":"derivative of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2]."},{"id":"e-c22cc344febafff9","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-aec89886b0fe4dfc","conclusion_name":"one_plus_derivative of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2]."},{"id":"e-fd137cc1379ca530","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-4c27e7f9b3484192","conclusion_name":"shift_x_plus_one of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2]."}],"used_by_total":6,"links":[{"id":"l-3fda78aa3b154e87","kind":"fingerprint_related","node_a_id":"n-e18d516553291356","node_b_id":"n-b8dd1392a9092a24","fingerprint":"f6-d99ad6edcacedc3c","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d99ad6edcacedc3c"},"other_id":"n-b8dd1392a9092a24","other":{"id":"n-b8dd1392a9092a24","name":"reversal of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2].","first_index":1,"fingerprint":"f6-d99ad6edcacedc3c","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","4"],["1","14","28"]],"card_rows":[["1"],["1","4"],["1","14","28"],["1","30","210","280"]],"row_sums_preview":["1","5","43","521","8113","154001","3442915","88491173"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e18d516553291356","steps":["reverse"],"edges":["e-2dd7ffd5e041969b"],"text":"A290598 \u2192 reverse"},"headline":"A290598 \u2192 reverse","chain":null}},{"id":"l-dda82751f1649197","kind":"oeis_match","node_a_id":"n-e18d516553291356","node_b_id":null,"fingerprint":null,"oeis_id":"A290598","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A290598","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A290598","relation":"identification"},{"oeis_id":"A290598","relation":"match_triangle"}],"bfiles":[{"node_id":"n-e18d516553291356","oeis_id":"A290598","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":35747}],"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:           1;\n   2:           4,           1;\n   3:          28,          14,           1;\n   4:         280,         210,          30,          1;\n   5:        3640,        3640,         780,         52,         1;\n   6:       58240,       72800,       20800,       2080,        80,        1;\n   7:     1106560,     1659840,      592800,      79040,      4560,      114,       1;\n   8:    24344320,    42602560,    18258240,    3043040,    234080,     8778,     154,     1;\n   9:   608608000,  1217216000,   608608000,  121721600,  11704000,   585200,   15400,   200,   1;\n  10: 17041024000, 38342304000, 21909888000, 5112307200, 589881600, 36867600, 1293600, 25200, 252, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4+x)*P(n-1,x) + (12+6*x)*d/dx P(n-1,x) + 9*x*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(4 + x)*P[n - 1, x] + (12 + 6*x)*D[P[n - 1, x], x] + 9*x*D[P[n - 1, x], {x, 2}]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (4 + x)*v[i - 1] + (12 + 6*x)*deriv(v[i - 1], x) + 9*x*deriv(deriv(v[i - 1], x), x)); 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":"A290598","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:           4,           1;\n  2:          28,          14,           1;\n  3:         280,         210,          30,          1;\n  4:        3640,        3640,         780,         52,         1;\n  5:       58240,       72800,       20800,       2080,        80,        1;\n  6:     1106560,     1659840,      592800,      79040,      4560,      114,       1;\n  7:    24344320,    42602560,    18258240,    3043040,    234080,     8778,     154,     1;\n  8:   608608000,  1217216000,   608608000,  121721600,  11704000,   585200,   15400,   200,   1;\n  9: 17041024000, 38342304000, 21909888000, 5112307200, 589881600, 36867600, 1293600, 25200, 252, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4+x)*P(n-1,x) + (12+6*x)*d/dx P(n-1,x) + 9*x*d^2/dx^2 P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(4 + x)*P[n - 1, x] + (12 + 6*x)*D[P[n - 1, x], x] + 9*x*D[P[n - 1, x], {x, 2}]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (4 + x)*v[i - 1] + (12 + 6*x)*deriv(v[i - 1], x) + 9*x*deriv(deriv(v[i - 1], x), x)); 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-e18d516553291356","steps":[],"edges":[],"text":"A290598"},"headline":"A290598: Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2].","chain":null}