A085478 → reverse → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(-3 + 2\,n\right)\,P_{n}(x) = \left(-14 - 11\,x + 8\,n + 6\,n x\right)\,P_{n-1}(x) + \left(-5 - 9\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 1 | 3 | ||||||
| 3 | 5 | 5 | 1 | 11 | |||||
| 4 | 13 | 20 | 9 | 1 | 43 | ||||
| 5 | 34 | 71 | 51 | 14 | 1 | 171 | |||
| 6 | 89 | 235 | 233 | 105 | 20 | 1 | 683 | ||
| 7 | 233 | 744 | 942 | 594 | 190 | 27 | 1 | 2731 | |
| 8 | 610 | 2285 | 3522 | 2860 | 1295 | 315 | 35 | 1 | 10923 |
Compute more
?
Technical details
- Node id
n-972e33de68e48c50· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-5870c1c52d074a69
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 1; 3: 5, 5, 1; 4: 13, 20, 9, 1; 5: 34, 71, 51, 14, 1; 6: 89, 235, 233, 105, 20, 1; 7: 233, 744, 942, 594, 190, 27, 1; 8: 610, 2285, 3522, 2860, 1295, 315, 35, 1; 9: 1597, 6865, 12473, 12402, 7285, 2534, 490, 44, 1; 10: 4181, 20284, 42447, 49963, 36122, 16407, 4578, 726, 54, 1;
%F FormulaThe row polynomials satisfy (2*n-3)*P(n,x) = (8*n-14+(6*n-11)*x)*P(n-1,x) - (5+9*x+4*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n - 14 + (6*n - 11)*x)*P[n - 1, x] - (5 + 9*x + 4*x^2)*D[P[n - 1, x], x])/(2*n - 3)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((8*n - 14 + (6*n - 11)*x)*v[i - 1] - (5 + 9*x + 4*x^2)*deriv(v[i - 1], x))/(2*n - 3)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
Related ?
Same fingerprint ?
- A060920: Bisection of Fibonacci triangle A037027: even-indexed members of column sequences of A037027 (not counting lea…
- A122076 → D
- A060920 → reverse
- A085478 → x ↦ x/(x+1)
- A103327 → basis A013611 → x ↦ x+1
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023