A156992 → basis A008277 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-2\,n - 8\,n x + 9\,n x^{2} - 2\,n^{2} - 8\,n^{2} x + 9\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(-4\,n x + 8\,n x^{2} + 4\,n x^{3} - 4\,n^{2} x + 8\,n^{2} x^{2} + 4\,n^{2} x^{3}\right)\,P_{n-2}'(x) + \left(-n x^{2} + 4\,n x^{3} - n^{2} x^{2} + 4\,n^{2} x^{3}\right)\,P_{n-2}''(x) + \left(3 + 4\,x + 3\,n + 4\,n x\right)\,P_{n-1}(x) + \left(2\,x - 4\,x^{2} + 2\,n x - 4\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 8\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 8 | 12 | ||||||
| 2 | 24 | 120 | 54 | 198 | |||||
| 3 | 192 | 1824 | 1944 | 384 | 4344 | ||||
| 4 | 1920 | 31200 | 59400 | 26880 | 3000 | 122400 | |||
| 5 | 23040 | 607680 | 1846800 | 1440000 | 360000 | 25920 | 4303440 | ||
| 6 | 322560 | 13406400 | 61281360 | 73382400 | 30870000 | 4898880 | 246960 | 184408560 | |
| 7 | 5160960 | 332075520 | 2202318720 | 3806853120 | 2399040000 | 629959680 | 69148800 | 2580480 | 9447137280 |
Compute more
?
Technical details
- Node id
n-2bc5bb45e09155dc· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-fefd2b9ccc27c8c7
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept 0)
- Palindromic rows: no
- γ-positive (gamma_positive): no
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 4, 8; 2: 24, 120, 54; 3: 192, 1824, 1944, 384; 4: 1920, 31200, 59400, 26880, 3000; 5: 23040, 607680, 1846800, 1440000, 360000, 25920; 6: 322560, 13406400, 61281360, 73382400, 30870000, 4898880, 246960; 7: 5160960, 332075520, 2202318720, 3806853120, 2399040000, 629959680, 69148800, 2580480; 8: 92897280, 9151833600, 86008003200, 206545489920, 183082032000, 70779018240, 12695719680, 1021870080, 29393280; 9: 1857945600, 278270899200, 3646236384000, 11856305664000, 14212195200000, 7590912537600, 1979038656000, 257789952000, 15872371200, 362880000;
%F FormulaThe row polynomials satisfy P(n,x) = -(2*n^2+2*n+(8*n^2+8*n)*x-(9*n^2+9*n)*x^2)*P(n-2,x) - ((4*n^2+4*n)*x-(8*n^2+8*n)*x^2-(4*n^2+4*n)*x^3)*d/dx P(n-2,x) - ((n^2+n)*x^2-(4*n^2+4*n)*x^3)*d^2/dx^2 P(n-2,x) + (3*n+3+(4*n+4)*x)*P(n-1,x) + ((2*n+2)*x-(4*n+4)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 8*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(2*n^2 + 2*n + (8*n^2 + 8*n)*x - (9*n^2 + 9*n)*x^2)*P[n - 2, x] - ((4*n^2 + 4*n)*x - (8*n^2 + 8*n)*x^2 - (4*n^2 + 4*n)*x^3)*D[P[n - 2, x], x] - ((n^2 + n)*x^2 - (4*n^2 + 4*n)*x^3)*D[P[n - 2, x], {x, 2}] + (3*n + 3 + (4*n + 4)*x)*P[n - 1, x] + ((2*n + 2)*x - (4*n + 4)*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(2*n^2 + 2*n + (8*n^2 + 8*n)*x - (9*n^2 + 9*n)*x^2)*v[i - 2] - ((4*n^2 + 4*n)*x - (8*n^2 + 8*n)*x^2 - (4*n^2 + 4*n)*x^3)*deriv(v[i - 2], x) - ((n^2 + n)*x^2 - (4*n^2 + 4*n)*x^3)*deriv(deriv(v[i - 2], x), x) + (3*n + 3 + (4*n + 4)*x)*v[i - 1] + ((2*n + 2)*x - (4*n + 4)*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A008277 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A008277 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.