A055151 → D → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-8 - 2\,n + n^{2}\right)\,P_{n}(x) = \left(2\,n - 20\,n x + n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x) + \left(2\,n x - 8\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 0\)
\(P_{3}(x) = 0\)
\(P_{4}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | Pn(1) |
|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||
| 1 | 0 | ||||||
| 2 | 0 | ||||||
| 3 | 0 | ||||||
| 4 | 4 | 4 | |||||
| 5 | 20 | 20 | |||||
| 6 | 60 | 30 | 90 | ||||
| 7 | 140 | 210 | 350 | ||||
| 8 | 280 | 840 | 168 | 1288 | |||
| 9 | 504 | 2520 | 1512 | 4536 | |||
| 10 | 840 | 6300 | 7560 | 840 | 15540 | ||
| 11 | 1320 | 13860 | 27720 | 9240 | 52140 | ||
| 12 | 1980 | 27720 | 83160 | 55440 | 3960 | 172260 | |
| 13 | 2860 | 51480 | 216216 | 240240 | 51480 | 562276 | |
| 14 | 4004 | 90090 | 504504 | 840840 | 360360 | 18018 | 1817816 |
Compute more
?
Technical details
- Node id
n-2f1d141549840af4· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-5b6b8f74397d2d43
Observed on the stored rows ?
- Degrees: -1, -1, -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5 (half affine: slope 1, intercept -4)
- 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: 0; 1: 0; 2: 0; 3: 0; 4: 4; 5: 20; 6: 60, 30; 7: 140, 210; 8: 280, 840, 168; 9: 504, 2520, 1512;
%F FormulaThe row polynomials satisfy (n^2-2*n-8)*P(n,x) = (n^2+2*n+(4*n^2-20*n)*x)*P(n-1,x) + (2*n*x-8*n*x^2)*d/dx P(n-1,x) for n >= 5, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 0, P(3,x) = 0, P(4,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 0;
P[3, x_] := 0;
P[4, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + 2*n + (4*n^2 - 20*n)*x)*P[n - 1, x] + (2*n*x - 8*n*x^2)*D[P[n - 1, x], x])/(n^2 - 2*n - 8)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 0; v[4] = 0; v[5] = 4; for(n = 5, N, my(i = n + 1); v[i] = ((n^2 + 2*n + (4*n^2 - 20*n)*x)*v[i - 1] + (2*n*x - 8*n*x^2)*deriv(v[i - 1], x))/(n^2 - 2*n - 8)); 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
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
derivative of Triangular array of Motzkin polynomial coefficients.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangular array of Motzkin polynomial coefficients.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
narayana?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
narayana?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
-
from
Triangular array of Motzkin polynomial coefficients.?
-
-
from
derivative of Triangular array of Motzkin polynomial coefficients.?
Related ?
Same fingerprint ?
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