{"id":"n-fd57fb52999582af","revision":1,"first_index":0,"fingerprint":"f6-33d8e4d36deefb8f","name":"Mirror of the triangle A193730.","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":true,"rows":[["1"],["1","2"],["3","8","4"],["9","30","28","8"],["27","108","144","80","16"],["81","378","648","528","208","32"],["243","1296","2700","2880","1680","512","64"],["729","4374","10692","14040","10800","4896","1216","128"],["2187","14580","40824","63504","60480","36288","13440","2816","256"],["6561","48114","151632","272160","308448","229824","112896","35328","6400","512"],["19683","157464","551124","1119744","1469664","1306368","798336","331776","89856","14336","1024"],["59049","511758","1968300","4461480","6648480","6858432","5007744","2592000","933120","222720","31744","2048"],["177147","1653372","6928416","17321040","28868400","33872256","28740096","17791488","7983360","2534400","540672","69632","4096"],["531441","5314410","24091992","65819952","121247280","159353568","153964800","110854656","59533056","23569920","6690816","1290240","151552","8192"],["1594323","17006112","82904796","245643840","495381744","720555264","780601536","640493568","400308480","189775872","67212288","17252352","3035136","327680","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","15","75","375","1875","9375","46875","234375","1171875","5859375","29296875","146484375","732421875","3662109375"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A193731","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-3","-2"],["3","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169659,"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-4bdd8fdc89aba544","e-9f8eeb7fc7c6f7ec"]},{"id":169660,"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-4bdd8fdc89aba544","e-7e91e3841ad3db72","e-9f8eeb7fc7c6f7ec"]},{"id":169661,"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-4bdd8fdc89aba544","e-7e91e3841ad3db72","e-9f8eeb7fc7c6f7ec"]},{"id":169662,"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-4bdd8fdc89aba544"]},{"id":169663,"position":4,"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-7e91e3841ad3db72"]},{"id":169664,"position":5,"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-7e91e3841ad3db72"]}],"region_exact":{},"incoming_edges":[{"id":"e-4bdd8fdc89aba544","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-fd57fb52999582af","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"e01ae52179dcf77c5ca472b639dfd270f7fe3b5aafed2b4ed415f1ae5387c14a","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":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-7e91e3841ad3db72","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-fd57fb52999582af","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; here S_n is the identity","lean_route":null,"lean_declarations":[],"certificate_hash":"e578b61cd6c55ed438524710fdacd86482961d82f8417f82837500f1840a4b5e","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":"previous_interlaces_next"}],"premises":[]},{"id":"e-9f8eeb7fc7c6f7ec","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-fd57fb52999582af","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":"2836696052b18142524ffa96fd32f6128158102191876945cdcb5f2e7b9ea901","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-9b31f2c01a46cebd","kind":"fingerprint_related","node_a_id":"n-5406e3c8f7504399","node_b_id":"n-fd57fb52999582af","fingerprint":"f6-33d8e4d36deefb8f","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-33d8e4d36deefb8f"},"other_id":"n-5406e3c8f7504399","other":{"id":"n-5406e3c8f7504399","name":"Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (2x+1)^n and q(n,x) = (2x+1)^n.","first_index":0,"fingerprint":"f6-33d8e4d36deefb8f","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2","1"],["4","8","3"]],"card_rows":[["1"],["2","1"],["4","8","3"],["8","28","30","9"]],"row_sums_preview":["1","3","15","75","375","1875","9375","46875"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A193730"],"derivation":{"root":"n-5406e3c8f7504399","steps":[],"edges":[],"text":"A193730"},"headline":"A193730: Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (2x+1)^n and q(n,x) = (2x+1)^n.","chain":null}},{"id":"l-40d88f6e56f4acdc","kind":"oeis_match","node_a_id":"n-fd57fb52999582af","node_b_id":null,"fingerprint":null,"oeis_id":"A005053","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":"A005053","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-73f4d7b783e59e2b","kind":"oeis_match","node_a_id":"n-fd57fb52999582af","node_b_id":null,"fingerprint":null,"oeis_id":"A193730","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":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A193730","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c60488a990cb5165","kind":"oeis_match","node_a_id":"n-fd57fb52999582af","node_b_id":null,"fingerprint":null,"oeis_id":"A193731","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":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A193731","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A193731","relation":"identification"},{"oeis_id":"A193730","relation":"match_reversed_triangle"},{"oeis_id":"A005053","relation":"match_row_sums"},{"oeis_id":"A193731","relation":"match_triangle"}],"bfiles":[{"node_id":"n-fd57fb52999582af","oeis_id":"A005053","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":25,"oeis_terms_available":25,"term_count":200,"raw_size":14856},{"node_id":"n-fd57fb52999582af","oeis_id":"A193730","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":21476},{"node_id":"n-fd57fb52999582af","oeis_id":"A193731","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":21476}],"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,     2;\n  2:    3,     8,      4;\n  3:    9,    30,     28,      8;\n  4:   27,   108,    144,     80,     16;\n  5:   81,   378,    648,    528,    208,     32;\n  6:  243,  1296,   2700,   2880,   1680,    512,     64;\n  7:  729,  4374,  10692,  14040,  10800,   4896,   1216,   128;\n  8: 2187, 14580,  40824,  63504,  60480,  36288,  13440,  2816,  256;\n  9: 6561, 48114, 151632, 272160, 308448, 229824, 112896, 35328, 6400, 512;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (3*n-3+(2*n-2)*x)*P(n-1,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[((3*n - 3 + (2*n - 2)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {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] = ((3*n - 3 + (2*n - 2)*x)*v[i - 1])/(n - 1)); 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":"A193730","target":"reversed_triangle","first_row":0,"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:   4,    8,     3;\n  3:   8,   28,    30,      9;\n  4:  16,   80,   144,    108,     27;\n  5:  32,  208,   528,    648,    378,     81;\n  6:  64,  512,  1680,   2880,   2700,   1296,    243;\n  7: 128, 1216,  4896,  10800,  14040,  10692,   4374,    729;\n  8: 256, 2816, 13440,  36288,  60480,  63504,  40824,  14580,  2187;\n  9: 512, 6400, 35328, 112896, 229824, 308448, 272160, 151632, 48114, 6561;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (3*n-3+(2*n-2)*x)*P(n-1,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[((3*n - 3 + (2*n - 2)*x)*P[n - 1, x])/(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] = ((3*n - 3 + (2*n - 2)*x)*v[i - 1])/(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":0,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A193731","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:    1,     2;\n  2:    3,     8,      4;\n  3:    9,    30,     28,      8;\n  4:   27,   108,    144,     80,     16;\n  5:   81,   378,    648,    528,    208,     32;\n  6:  243,  1296,   2700,   2880,   1680,    512,     64;\n  7:  729,  4374,  10692,  14040,  10800,   4896,   1216,   128;\n  8: 2187, 14580,  40824,  63504,  60480,  36288,  13440,  2816,  256;\n  9: 6561, 48114, 151632, 272160, 308448, 229824, 112896, 35328, 6400, 512;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (3*n-3+(2*n-2)*x)*P(n-1,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[((3*n - 3 + (2*n - 2)*x)*P[n - 1, x])/(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] = ((3*n - 3 + (2*n - 2)*x)*v[i - 1])/(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":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-fd57fb52999582af","steps":[],"edges":[],"text":"A193731"},"headline":"A193731: Mirror of the triangle A193730.","chain":null}