A330510 → 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 - 3\,x - x^{2}\right)\,P_{n-2}(x) + \left(4 + 2\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 6 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 2 | 2 | |||||||
| 1 | 6 | 3 | 9 | ||||||
| 2 | 18 | 18 | 4 | 40 | |||||
| 3 | 54 | 81 | 37 | 5 | 177 | ||||
| 4 | 162 | 324 | 226 | 64 | 6 | 782 | |||
| 5 | 486 | 1215 | 1144 | 501 | 100 | 7 | 3453 | ||
| 6 | 1458 | 4374 | 5194 | 3098 | 966 | 146 | 8 | 15244 | |
| 7 | 4374 | 15309 | 21961 | 16630 | 7113 | 1694 | 203 | 9 | 67293 |
Compute more
?
Technical details
- Node id
n-94470298ec1d4aa5· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-db9ee1b7b985cf8f
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: 2; 1: 6, 3; 2: 18, 18, 4; 3: 54, 81, 37, 5; 4: 162, 324, 226, 64, 6; 5: 486, 1215, 1144, 501, 100, 7; 6: 1458, 4374, 5194, 3098, 966, 146, 8; 7: 4374, 15309, 21961, 16630, 7113, 1694, 203, 9; 8: 13122, 52488, 88300, 81192, 44326, 14568, 2772, 272, 10; 9: 39366, 177147, 341992, 370286, 246498, 103873, 27420, 4302, 354, 11;
%F FormulaThe row polynomials satisfy P(n,x) = -(3+3*x+x^2)*P(n-2,x) + (4+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 6 + 3*x.
%t MathematicaP[0, x_] := 2;
P[1, x_] := 6 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(3 + 3*x + x^2)*P[n - 2, x] + (4 + 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] = 2; v[2] = 6 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 3*x + x^2)*v[i - 2] + (4 + 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)
- 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 ›
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