A104684 → D → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(9 - 6\,n + n^{2}\right)\,P_{n}(x) = \left(20 + 19\,x - 18\,n - 16\,n x + 4\,n^{2} + 3\,n^{2} x\right)\,P_{n-1}(x) + \left(4\,x + 4\,x^{2} - 2\,n x - 2\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 0\)
\(P_{3}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||||||||
| 2 | 0 | |||||||||||||
| 3 | 2 | 2 | ||||||||||||
| 4 | 24 | 6 | 30 | |||||||||||
| 5 | 180 | 120 | 12 | 312 | ||||||||||
| 6 | 1120 | 1260 | 360 | 20 | 2760 | |||||||||
| 7 | 6300 | 10080 | 5040 | 840 | 30 | 22290 | ||||||||
| 8 | 33264 | 69300 | 50400 | 15120 | 1680 | 42 | 169806 | |||||||
| 9 | 168168 | 432432 | 415800 | 184800 | 37800 | 3024 | 56 | 1242080 | ||||||
| 10 | 823680 | 2522520 | 3027024 | 1801800 | 554400 | 83160 | 5040 | 72 | 8817696 | |||||
| 11 | 3938220 | 14002560 | 20180160 | 15135120 | 6306300 | 1441440 | 166320 | 7920 | 90 | 61178130 | ||||
| 12 | 18475600 | 74826180 | 126023040 | 114354240 | 60540480 | 18918900 | 3363360 | 308880 | 11880 | 110 | 416822670 | |||
| 13 | 85357272 | 387987600 | 748261800 | 798145920 | 514594080 | 205837632 | 50450400 | 7207200 | 540540 | 17160 | 132 | 2798399736 | ||
| 14 | 389398464 | 1963217256 | 4267863600 | 5237832600 | 3990729600 | 1955457504 | 617512896 | 122522400 | 14414400 | 900900 | 24024 | 156 | 18559873800 | |
| 15 | 1757701400 | 9734961600 | 23558607072 | 32720287600 | 28808079300 | 16761064320 | 6518191680 | 1676106432 | 275675400 | 27227200 | 1441440 | 32760 | 182 | 121839376386 |
Compute more
?
Technical details
- Node id
n-4efe71505c1f5edb· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-6832a290ef8b97c2
Observed on the stored rows ?
- Degrees: -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 (affine: slope 1, intercept -3)
- 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: 0; 2: 0; 3: 2; 4: 24, 6; 5: 180, 120, 12; 6: 1120, 1260, 360, 20; 7: 6300, 10080, 5040, 840, 30; 8: 33264, 69300, 50400, 15120, 1680, 42; 9: 168168, 432432, 415800, 184800, 37800, 3024, 56; 10: 823680, 2522520, 3027024, 1801800, 554400, 83160, 5040, 72;
%F FormulaThe row polynomials satisfy (n^2-6*n+9)*P(n,x) = (4*n^2-18*n+20+(3*n^2-16*n+19)*x)*P(n-1,x) - ((2*n-4)*x+(2*n-4)*x^2)*d/dx P(n-1,x) for n >= 4, with P(1,x) = 0, P(2,x) = 0, P(3,x) = 2.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 0;
P[3, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 18*n + 20 + (3*n^2 - 16*n + 19)*x)*P[n - 1, x] - ((2*n - 4)*x + (2*n - 4)*x^2)*D[P[n - 1, x], x])/(n^2 - 6*n + 9)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 4, N, my(i = n); v[i] = ((4*n^2 - 18*n + 20 + (3*n^2 - 16*n + 19)*x)*v[i - 1] - ((2*n - 4)*x + (2*n - 4)*x^2)*deriv(v[i - 1], x))/(n^2 - 6*n + 9)); 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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 Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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 ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
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 ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
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
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(…?
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