A059344 → basis A007318 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-3 - 2\,x + 4\,n + 2\,n x\right)\,P_{n-1}(x) + \left(-16 - 16\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 1 | 1 | |||
| 2 | 5 | 2 | 7 | ||
| 3 | 13 | 6 | 19 | ||
| 4 | 73 | 60 | 12 | 145 | |
| 5 | 281 | 260 | 60 | 601 | |
| 6 | 1741 | 2190 | 900 | 120 | 4951 |
| 7 | 8485 | 11802 | 5460 | 840 | 26587 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(P_{n}(x) = \left(-4 - 2\,x + 4\,n + 2\,n x\right)\,P_{n-2}(x) + \left(1\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Technical details
- Node id
n-63e0f623f2aa9065· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-a218c88012150f57)- Fingerprint
f6-926de34f2f3d44d1
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 2: 5, 2; 3: 13, 6; 4: 73, 60, 12; 5: 281, 260, 60; 6: 1741, 2190, 900, 120; 7: 8485, 11802, 5460, 840; 8: 57233, 97496, 61320, 16800, 1680; 9: 328753, 610920, 424872, 131040, 15120;
%F FormulaThe row polynomials satisfy P(n,x) = (4*n-3+(2*n-2)*x)*P(n-1,x) - (16+16*x+4*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n - 3 + (2*n - 2)*x)*P[n - 1, x] - (16 + 16*x + 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; for(n = 1, N, my(i = n + 1); v[i] = (4*n - 3 + (2*n - 2)*x)*v[i - 1] - (16 + 16*x + 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
References
- [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