A094638 → basis A013611 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-16\,n x^{2} + 8\,n^{2} x + 32\,n^{2} x^{2} - n^{3} - 8\,n^{3} x - 16\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 8\,n x + 2\,n^{2} + 8\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 8\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 8 | 10 | ||||||
| 2 | 6 | 56 | 96 | 158 | |||||
| 3 | 24 | 368 | 1392 | 1536 | 3320 | ||||
| 4 | 120 | 2608 | 15792 | 37376 | 30720 | 86616 | |||
| 5 | 720 | 20448 | 172992 | 645376 | 1118720 | 737280 | 2695536 | ||
| 6 | 5040 | 177696 | 1947072 | 10053376 | 27192320 | 37380096 | 20643840 | 97399440 | |
| 7 | 40320 | 1703808 | 23039808 | 153117696 | 569406720 | 1212702720 | 1386233856 | 660602880 | 4006847808 |
Compute more
?
Technical details
- Node id
n-57fc439b8bd33ef7· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-e22d44c4b2712e20
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: 2, 8; 2: 6, 56, 96; 3: 24, 368, 1392, 1536; 4: 120, 2608, 15792, 37376, 30720; 5: 720, 20448, 172992, 645376, 1118720, 737280; 6: 5040, 177696, 1947072, 10053376, 27192320, 37380096, 20643840; 7: 40320, 1703808, 23039808, 153117696, 569406720, 1212702720, 1386233856, 660602880; 8: 362880, 17914752, 289141056, 2361091072, 11249368320, 32779542528, 57750339584, 56641978368, 23781703680; 9: 3628800, 205274880, 3858807168, 37489681408, 218742781440, 813768136704, 1954244182016, 2942433755136, 2531817160704, 951268147200;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(8*n^3-8*n^2)*x+(16*n^3-32*n^2+16*n)*x^2)*P(n-2,x) + (2*n^2-1+(8*n^2-8*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 8*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (8*n^3 - 8*n^2)*x + (16*n^3 - 32*n^2 + 16*n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (8*n^2 - 8*n)*x)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (8*n^3 - 8*n^2)*x + (16*n^3 - 32*n^2 + 16*n)*x^2)*v[i - 2] + (2*n^2 - 1 + (8*n^2 - 8*n)*x)*v[i - 1])/(n - 1)); 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_A013611 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the …?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the …?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.