A207824 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-14\,n - 14\,n x - 2\,n x^{2} + 2\,n^{3}\right)\,P_{n}(x) = \left(-51 - 51\,x - 13\,x^{2} - x^{3} - 41\,n - 49\,n x - 13\,n x^{2} - n x^{3} + 15\,n^{2} + 3\,n^{2} x + 5\,n^{3} + n^{3} x\right)\,P_{n-1}(x) + \left(-336 - 349\,x - 127\,x^{2} - 19\,x^{3} - x^{4} + 21\,n + 10\,n x + n x^{2} + 21\,n^{2} + 10\,n^{2} x + n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 6 | 1 | 7 | ||||||
| 2 | 34 | 12 | 1 | 47 | |||||
| 3 | 188 | 103 | 18 | 1 | 310 | ||||
| 4 | 1021 | 764 | 207 | 24 | 1 | 2017 | |||
| 5 | 5468 | 5208 | 1928 | 346 | 30 | 1 | 12981 | ||
| 6 | 28959 | 33572 | 15831 | 3880 | 520 | 36 | 1 | 82799 | |
| 7 | 151976 | 207921 | 119430 | 37285 | 6820 | 729 | 42 | 1 | 524204 |
Compute more
?
Technical details
- Node id
n-fb9bfbbcf93b0a63· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-de33d2c8f30482a7
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: 6, 1; 2: 34, 12, 1; 3: 188, 103, 18, 1; 4: 1021, 764, 207, 24, 1; 5: 5468, 5208, 1928, 346, 30, 1; 6: 28959, 33572, 15831, 3880, 520, 36, 1; 7: 151976, 207921, 119430, 37285, 6820, 729, 42, 1; 8: 791526, 1249380, 847515, 322360, 75090, 10948, 973, 48, 1; 9: 4096030, 7331655, 5741640, 2579830, 732130, 135891, 16464, 1252, 54, 1;
%F FormulaThe row polynomials satisfy (2*n^3-14*n-14*n*x-2*n*x^2)*P(n,x) = (5*n^3+15*n^2-41*n-51+(n^3+3*n^2-49*n-51)*x-(13*n+13)*x^2-(n+1)*x^3)*P(n-1,x) + (21*n^2+21*n-336+(10*n^2+10*n-349)*x+(n^2+n-127)*x^2-19*x^3-x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((5*n^3 + 15*n^2 - 41*n - 51 + (n^3 + 3*n^2 - 49*n - 51)*x - (13*n + 13)*x^2 - (n + 1)*x^3)*P[n - 1, x] + (21*n^2 + 21*n - 336 + (10*n^2 + 10*n - 349)*x + (n^2 + n - 127)*x^2 - 19*x^3 - x^4)*D[P[n - 1, x], x])/(2*n^3 - 14*n - 14*n*x - 2*n*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((5*n^3 + 15*n^2 - 41*n - 51 + (n^3 + 3*n^2 - 49*n - 51)*x - (13*n + 13)*x^2 - (n + 1)*x^3)*v[i - 1] + (21*n^2 + 21*n - 336 + (10*n^2 + 10*n - 349)*x + (n^2 + n - 127)*x^2 - 19*x^3 - x^4)*deriv(v[i - 1], x))/(2*n^3 - 14*n - 14*n*x - 2*n*x^2)); 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of coefficients of Chebyshev's S(n,x+5) polynomials (exponents of x in increasing order).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Three-term recurrence criterion (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).?
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).?
-
from
Triangle of coefficients of Chebyshev's S(n,x+5) polynomials (exponents of x in increasing order).?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023