{"id":"n-cedb1276760d9bb1","revision":1,"first_index":0,"fingerprint":"f6-ae9eedd6404e58f4","name":"Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^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":true,"rows":[["1"],["1","2"],["2","9","10"],["4","28","65","50"],["8","76","270","425","250"],["16","192","920","2200","2625","1250"],["32","464","2800","9000","16250","15625","6250"],["64","1088","7920","32000","77500","112500","90625","31250"],["128","2496","21280","103600","315000","612500","743750","515625","156250"],["256","5632","55040","313600","1148000","2800000","4550000","4750000","2890625","781250"],["512","12544","138240","902400","3864000","11340000","23100000","32250000","29531250","16015625","3906250"],["1024","27648","339200","2496000","12240000","42000000","102900000","180000000","220312500","179687500","87890625","19531250"],["2048","60416","816640","6688000","36960000","145200000","415800000","874500000","1340625000","1460937500","1074218750","478515625","97656250"],["4096","131072","1935360","17459200","107360000","475200000","1557600000","3828000000","7053750000","9625000000","9453125000","6328125000","2587890625","488281250"],["8192","282624","4526080","44595200","302016000","1487200000","5491200000","15444000000","33247500000","54518750000","67031250000","59921875000","36816406250","13916015625","2441406250"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","21","147","1029","7203","50421","352947","2470629","17294403","121060821","847425747","5931980229","41523861603","290667031221"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A193726","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":[["-2","-5"],["2","5"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169629,"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-199adcd06afdfbd8","e-c3ca797e66b27221"]},{"id":169630,"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-199adcd06afdfbd8","e-c3ca797e66b27221","e-dd8967fa2e08b2a3"]},{"id":169631,"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-199adcd06afdfbd8","e-c3ca797e66b27221","e-dd8967fa2e08b2a3"]},{"id":169632,"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-c3ca797e66b27221"]},{"id":169633,"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-dd8967fa2e08b2a3"]},{"id":169634,"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-dd8967fa2e08b2a3"]}],"region_exact":{},"incoming_edges":[{"id":"e-199adcd06afdfbd8","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-cedb1276760d9bb1","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":"19e9f02d2b78c69e81e6e657112d16f95a30b2e84a1e917fd11597fc52333151","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]},{"id":"e-c3ca797e66b27221","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-cedb1276760d9bb1","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":"29e389deeeed8754ff749bc74ad8f4a0eec4851b87a9034329b12143f88ed9fa","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-dd8967fa2e08b2a3","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-cedb1276760d9bb1","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":"c0899324d8e853c8443e4ef65048d2f275e78838bc41413532a415d34bd4df26","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":[]}],"used_by":[{"id":"e-22c9ba4d8e0c0a0e","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-f929f0b56bd73253","conclusion_name":"basis_map_A013610 of Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n."},{"id":"e-3c1a0c86d879ec10","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-40234e58e7c7f4e9","conclusion_name":"basis_map_A007318 of Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n."},{"id":"e-9453ba0e1b53d61a","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-7ffe75f198ff0f55","conclusion_name":"basis_map_A013611 of Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n."},{"id":"e-e05c6e2f3f175c5f","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-e2d2c5e8ff2d490b","conclusion_name":"basis_map_A013609 of Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n."},{"id":"e-f478fe63f2749dc3","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-3f7299f6bf79f102","conclusion_name":"basis_map_A008277 of Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n."}],"used_by_total":5,"links":[{"id":"l-a57a2ea13a57c1bb","kind":"fingerprint_related","node_a_id":"n-cedb1276760d9bb1","node_b_id":"n-2ed1083d14adf57b","fingerprint":"f6-ae9eedd6404e58f4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ae9eedd6404e58f4"},"other_id":"n-2ed1083d14adf57b","other":{"id":"n-2ed1083d14adf57b","name":"Mirror of the triangle A193726.","first_index":0,"fingerprint":"f6-ae9eedd6404e58f4","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2","1"],["10","9","2"]],"card_rows":[["1"],["2","1"],["10","9","2"],["50","65","28","4"]],"row_sums_preview":["1","3","21","147","1029","7203","50421","352947"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A193727"],"derivation":{"root":"n-2ed1083d14adf57b","steps":[],"edges":[],"text":"A193727"},"headline":"A193727: Mirror of the triangle A193726.","chain":null}},{"id":"l-9840da8f40e35c59","kind":"oeis_match","node_a_id":"n-cedb1276760d9bb1","node_b_id":null,"fingerprint":null,"oeis_id":"A169634","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":"A169634","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c0f133caa1992729","kind":"oeis_match","node_a_id":"n-cedb1276760d9bb1","node_b_id":null,"fingerprint":null,"oeis_id":"A193726","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A193726","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-eed5fad632112ce1","kind":"oeis_match","node_a_id":"n-cedb1276760d9bb1","node_b_id":null,"fingerprint":null,"oeis_id":"A193727","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A193727","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A193726","relation":"identification"},{"oeis_id":"A193727","relation":"match_reversed_triangle"},{"oeis_id":"A169634","relation":"match_row_sums"},{"oeis_id":"A193726","relation":"match_triangle"}],"bfiles":[{"node_id":"n-cedb1276760d9bb1","oeis_id":"A169634","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":22,"oeis_terms_available":22,"term_count":200,"raw_size":17903},{"node_id":"n-cedb1276760d9bb1","oeis_id":"A193726","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":24474},{"node_id":"n-cedb1276760d9bb1","oeis_id":"A193727","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":24474}],"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:   2,    9,    10;\n  3:   4,   28,    65,     50;\n  4:   8,   76,   270,    425,     250;\n  5:  16,  192,   920,   2200,    2625,    1250;\n  6:  32,  464,  2800,   9000,   16250,   15625,    6250;\n  7:  64, 1088,  7920,  32000,   77500,  112500,   90625,   31250;\n  8: 128, 2496, 21280, 103600,  315000,  612500,  743750,  515625,  156250;\n  9: 256, 5632, 55040, 313600, 1148000, 2800000, 4550000, 4750000, 2890625, 781250;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(5*n-5)*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[((2*n - 2 + (5*n - 5)*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] = ((2*n - 2 + (5*n - 5)*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":"A193726","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:   2,    9,    10;\n  3:   4,   28,    65,     50;\n  4:   8,   76,   270,    425,     250;\n  5:  16,  192,   920,   2200,    2625,    1250;\n  6:  32,  464,  2800,   9000,   16250,   15625,    6250;\n  7:  64, 1088,  7920,  32000,   77500,  112500,   90625,   31250;\n  8: 128, 2496, 21280, 103600,  315000,  612500,  743750,  515625,  156250;\n  9: 256, 5632, 55040, 313600, 1148000, 2800000, 4550000, 4750000, 2890625, 781250;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(5*n-5)*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[((2*n - 2 + (5*n - 5)*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] = ((2*n - 2 + (5*n - 5)*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}},{"oeis_id":"A193727","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:     10,       9,       2;\n  3:     50,      65,      28,       4;\n  4:    250,     425,     270,      76,       8;\n  5:   1250,    2625,    2200,     920,     192,      16;\n  6:   6250,   15625,   16250,    9000,    2800,     464,     32;\n  7:  31250,   90625,  112500,   77500,   32000,    7920,   1088,    64;\n  8: 156250,  515625,  743750,  612500,  315000,  103600,  21280,  2496,  128;\n  9: 781250, 2890625, 4750000, 4550000, 2800000, 1148000, 313600, 55040, 5632, 256;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (2*n-2+(5*n-5)*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[((2*n - 2 + (5*n - 5)*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] = ((2*n - 2 + (5*n - 5)*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}}],"derivation":{"root":"n-cedb1276760d9bb1","steps":[],"edges":[],"text":"A193726"},"headline":"A193726: Triangular array:  the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n.","chain":null}