A207823 → basis A013611 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-336\,n - 160\,n x + 128\,n^{3} x^{2}\right)\,P_{n}(x) = \left(-840 - 1408\,x - 640\,x^{2} - 840\,n - 1744\,n x - 640\,n x^{2} + 256\,n x^{3} - 336\,n^{2} x + 320\,n^{2} x^{2} + 512\,n^{2} x^{3} + 320\,n^{3} x^{2} + 256\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-441 - 1260\,x - 1136\,x^{2} - 320\,x^{3} + 336\,n x^{2} + 640\,n x^{3} + 256\,n x^{4} + 336\,n^{2} x^{2} + 640\,n^{2} x^{3} + 256\,n^{2} x^{4}\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 | 5 | 8 | 13 | ||||||
| 2 | 24 | 80 | 48 | 152 | |||||
| 3 | 115 | 584 | 720 | 256 | 1675 | ||||
| 4 | 551 | 3760 | 7056 | 5120 | 1280 | 17767 | |||
| 5 | 2640 | 22624 | 57120 | 62976 | 32000 | 6144 | 183504 | ||
| 6 | 12649 | 130480 | 414288 | 614400 | 473600 | 184320 | 28672 | 1858409 | |
| 7 | 60605 | 730968 | 2797200 | 5218560 | 5408000 | 3188736 | 1003520 | 131072 | 18538661 |
Compute more
?
Technical details
- Node id
n-ee5b7fd4b8da8927· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-c231a2958250494c
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: 5, 8; 2: 24, 80, 48; 3: 115, 584, 720, 256; 4: 551, 3760, 7056, 5120, 1280; 5: 2640, 22624, 57120, 62976, 32000, 6144; 6: 12649, 130480, 414288, 614400, 473600, 184320, 28672; 7: 60605, 730968, 2797200, 5218560, 5408000, 3188736, 1003520, 131072; 8: 290376, 4009200, 17957520, 40396800, 52659200, 41717760, 19869696, 5242880, 589824; 9: 1391275, 21638040, 111045600, 292538880, 459872000, 458164224, 293027840, 116916224, 26542080, 2621440;
%F FormulaThe row polynomials satisfy -(336*n+160*n*x-128*n^3*x^2)*P(n,x) = -(840*n+840+(336*n^2+1744*n+1408)*x-(320*n^3+320*n^2-640*n-640)*x^2-(256*n^3+512*n^2+256*n)*x^3)*P(n-1,x) - (441+1260*x-(336*n^2+336*n-1136)*x^2-(640*n^2+640*n-320)*x^3-(256*n^2+256*n)*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[(-(840*n + 840 + (336*n^2 + 1744*n + 1408)*x - (320*n^3 + 320*n^2 - 640*n - 640)*x^2 - (256*n^3 + 512*n^2 + 256*n)*x^3)*P[n - 1, x] - (441 + 1260*x - (336*n^2 + 336*n - 1136)*x^2 - (640*n^2 + 640*n - 320)*x^3 - (256*n^2 + 256*n)*x^4)*D[P[n - 1, x], x])/(-336*n - 160*n*x + 128*n^3*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] = (-(840*n + 840 + (336*n^2 + 1744*n + 1408)*x - (320*n^3 + 320*n^2 - 640*n - 640)*x^2 - (256*n^3 + 512*n^2 + 256*n)*x^3)*v[i - 1] - (441 + 1260*x - (336*n^2 + 336*n - 1136)*x^2 - (640*n^2 + 640*n - 320)*x^3 - (256*n^2 + 256*n)*x^4)*deriv(v[i - 1], x))/(-336*n - 160*n*x + 128*n^3*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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013611 of 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).?
-
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
basis_map_A013611 of Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).?
References
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [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