A137320 → basis A013609 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(144\,x^{2} - 16\,n x - n^{2}\right)\,P_{n-2}(x) + \left(64\,x^{3} + 16\,n x^{2}\right)\,P_{n-2}'(x) + \left(1 + 16\,x + 2\,n\right)\,P_{n-1}(x) + \left(-16\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 16\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 16 | 18 | ||||||
| 2 | 6 | 80 | 144 | 230 | |||||
| 3 | 24 | 416 | 1296 | 1024 | 2760 | ||||
| 4 | 120 | 2464 | 10224 | 14336 | 6400 | 33544 | |||
| 5 | 720 | 16704 | 83520 | 158720 | 128000 | 36864 | 424528 | ||
| 6 | 5040 | 128448 | 734976 | 1704960 | 1888000 | 995328 | 200704 | 5657456 | |
| 7 | 40320 | 1108224 | 7035840 | 18866176 | 25760000 | 18837504 | 7024640 | 1048576 | 79721280 |
Compute more
?
Technical details
- Node id
n-9e538a84352d383f· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-eb28e60e59f86df9
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, 16; 2: 6, 80, 144; 3: 24, 416, 1296, 1024; 4: 120, 2464, 10224, 14336, 6400; 5: 720, 16704, 83520, 158720, 128000, 36864; 6: 5040, 128448, 734976, 1704960, 1888000, 995328, 200704; 7: 40320, 1108224, 7035840, 18866176, 25760000, 18837504, 7024640, 1048576; 8: 362880, 10619136, 73296576, 219828224, 349753600, 317915136, 165781504, 46137344, 5308416; 9: 3628800, 111997440, 828537984, 2719502336, 4871462400, 5193732096, 3388686336, 1327497216, 286654464, 26214400;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^2+16*n*x-144*x^2)*P(n-2,x) + (16*n*x^2+64*x^3)*d/dx P(n-2,x) + (2*n+1+16*x)*P(n-1,x) - 16*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 16*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 16*x;
P[n_, x_] := P[n, x] = Expand[-(n^2 + 16*n*x - 144*x^2)*P[n - 2, x] + (16*n*x^2 + 64*x^3)*D[P[n - 2, x], x] + (2*n + 1 + 16*x)*P[n - 1, x] - 16*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] = 2 + 16*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 16*n*x - 144*x^2)*v[i - 2] + (16*n*x^2 + 64*x^3)*deriv(v[i - 2], x) + (2*n + 1 + 16*x)*v[i - 1] - 16*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_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1…?
-
Geometric basis map (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…?
-
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…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
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 ›
-
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) (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…?
- ↑ 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…?
-
Geometric basis map (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…?
- ↑ Liu–Wang theorem (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)
- ↑ 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…?
-
from
basis_map_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1…?
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.