A249248 → reverse → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(1 + x + n + n x\right)\,P_{n-2}(x) + \left(2 + x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 1 | 5 | ||||||
| 2 | 11 | 9 | 1 | 21 | |||||
| 3 | 38 | 49 | 15 | 1 | 103 | ||||
| 4 | 131 | 236 | 129 | 22 | 1 | 519 | |||
| 5 | 490 | 1125 | 878 | 269 | 30 | 1 | 2793 | ||
| 6 | 1897 | 5309 | 5436 | 2473 | 490 | 39 | 1 | 15645 | |
| 7 | 7714 | 25435 | 32205 | 19558 | 5845 | 816 | 49 | 1 | 91623 |
Compute more
?
Technical details
- Node id
n-27fa2a3cd638c61f· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-783f05b943b24c5b
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, 1; 2: 11, 9, 1; 3: 38, 49, 15, 1; 4: 131, 236, 129, 22, 1; 5: 490, 1125, 878, 269, 30, 1; 6: 1897, 5309, 5436, 2473, 490, 39, 1; 7: 7714, 25435, 32205, 19558, 5845, 816, 49, 1; 8: 32501, 123438, 186550, 142502, 57915, 12238, 1274, 60, 1; 9: 142142, 610867, 1072938, 989184, 512362, 149001, 23436, 1894, 72, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (n+1+(n+1)*x)*P(n-2,x) + (2+x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + x;
P[n_, x_] := P[n, x] = Expand[(n + 1 + (n + 1)*x)*P[n - 2, x] + (2 + x)*P[n - 1, 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 + x; for(n = 2, N, my(i = n + 1); v[i] = (n + 1 + (n + 1)*x)*v[i - 2] + (2 + x)*v[i - 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 (−∞, -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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
reversal of Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
Related ?
Same fingerprint ?
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