A034807 → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-3 - 2\,x + 3\,n + 2\,n x\right)\,P_{n-1}(x) + \left(-5 - 9\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 2 | 2 | |||
| 1 | 1 | 1 | |||
| 2 | 3 | 2 | 5 | ||
| 3 | 4 | 3 | 7 | ||
| 4 | 7 | 8 | 2 | 17 | |
| 5 | 11 | 15 | 5 | 31 | |
| 6 | 18 | 30 | 15 | 2 | 65 |
| 7 | 29 | 56 | 35 | 7 | 127 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(P_{n}(x) = \left(1 + x\right)\,P_{n-2}(x) + \left(1\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 1\)
Technical details
- Node id
n-1074deee959abad5· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-cddea33175d38134)- Fingerprint
f6-c568ad932ec199be
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: 2; 1: 1; 2: 3, 2; 3: 4, 3; 4: 7, 8, 2; 5: 11, 15, 5; 6: 18, 30, 15, 2; 7: 29, 56, 35, 7; 8: 47, 104, 80, 24, 2; 9: 76, 189, 171, 66, 9;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (3*n-3+(2*n-2)*x)*P(n-1,x) - (5+9*x+4*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 1.
%t MathematicaP[0, x_] := 2;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((3*n - 3 + (2*n - 2)*x)*P[n - 1, x] - (5 + 9*x + 4*x^2)*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((3*n - 3 + (2*n - 2)*x)*v[i - 1] - (5 + 9*x + 4*x^2)*deriv(v[i - 1], x))/(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 (−∞, -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
Related ?
Same fingerprint ?
- A245962: Triangle read by rows: T(n,k) is the number of induced subgraphs of the Lucas cube Lambda(n) that are isomorph…
- reversed rows → x ↦ x+1
- A113214 → x ↦ x/(x+1)
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