A111125 → 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(-12 - 9\,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 | 4 | 3 | 7 | ||||||
| 3 | 11 | 15 | 5 | 31 | |||||
| 4 | 29 | 56 | 35 | 7 | 127 | ||||
| 5 | 76 | 189 | 171 | 66 | 9 | 511 | |||
| 6 | 199 | 605 | 715 | 407 | 110 | 11 | 2047 | ||
| 7 | 521 | 1872 | 2730 | 2054 | 832 | 169 | 13 | 8191 | |
| 8 | 1364 | 5655 | 9810 | 9180 | 4965 | 1533 | 245 | 15 | 32767 |
Compute more
?
Technical details
- Node id
n-51b406bd20106615· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-347434f4a19cf0c5
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: 4, 3; 3: 11, 15, 5; 4: 29, 56, 35, 7; 5: 76, 189, 171, 66, 9; 6: 199, 605, 715, 407, 110, 11; 7: 521, 1872, 2730, 2054, 832, 169, 13; 8: 1364, 5655, 9810, 9180, 4965, 1533, 245, 15; 9: 3571, 16779, 33745, 37774, 25585, 10642, 2618, 340, 17; 10: 9349, 49096, 112309, 146357, 119168, 62453, 20862, 4218, 456, 19;
%F FormulaThe row polynomials satisfy (2*n-3)*P(n,x) = (8*n-12+(6*n-9)*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 - 12 + (6*n - 9)*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 - 12 + (6*n - 9)*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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
Related ?
Same fingerprint ?
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