A391045 → θ+1 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(24 - 64\,n + 62\,n^{2} - 26\,n^{3} + 4\,n^{4}\right)\,P_{n}(x) = \left(6 + 396\,x - 22\,n - 900\,n x + 30\,n^{2} + 752\,n^{2} x - 18\,n^{3} - 272\,n^{3} x + 4\,n^{4} + 36\,n^{4} x\right)\,P_{n-1}(x) + \left(-38\,x + 292\,x^{2} + 70\,n x - 516\,n x^{2} - 42\,n^{2} x + 294\,n^{2} x^{2} + 8\,n^{3} x - 52\,n^{3} x^{2}\right)\,P_{n-1}'(x) + \left(-10\,x^{2} + 40\,x^{3} + 14\,n x^{2} - 56\,n x^{3} - 5\,n^{2} x^{2} + 20\,n^{2} x^{3}\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | ||||||||||||||
| 2 | 2 | 2 | |||||||||||||
| 3 | 8 | 6 | 14 | ||||||||||||
| 4 | 18 | 60 | 12 | 90 | |||||||||||
| 5 | 32 | 252 | 240 | 20 | 544 | ||||||||||
| 6 | 50 | 720 | 1680 | 700 | 30 | 3180 | |||||||||
| 7 | 72 | 1650 | 7200 | 7560 | 1680 | 42 | 18204 | ||||||||
| 8 | 98 | 3276 | 23100 | 46200 | 26460 | 3528 | 56 | 102718 | |||||||
| 9 | 128 | 5880 | 61152 | 200200 | 221760 | 77616 | 6720 | 72 | 573528 | ||||||
| 10 | 162 | 9792 | 141120 | 687960 | 1261260 | 864864 | 199584 | 11880 | 90 | 3176712 | |||||
| 11 | 200 | 15390 | 293760 | 1999200 | 5503680 | 6306300 | 2882880 | 463320 | 19800 | 110 | 17484640 | ||||
| 12 | 242 | 23100 | 564300 | 5116320 | 19792080 | 34306272 | 26426400 | 8494200 | 990990 | 31460 | 132 | 95745496 | |||
| 13 | 288 | 33396 | 1016400 | 11850300 | 61395840 | 150419808 | 176432256 | 96267600 | 22651200 | 1981980 | 48048 | 156 | 522097272 | ||
| 14 | 338 | 46800 | 1736592 | 25325300 | 169459290 | 558702144 | 931170240 | 778192272 | 312869700 | 55621280 | 3747744 | 70980 | 182 | 2836942862 | |
| 15 | 392 | 63882 | 2839200 | 50650600 | 425465040 | 1818863046 | 4097149056 | 4888643760 | 3026303280 | 924703780 | 127423296 | 6757296 | 101920 | 210 | 15368964758 |
Compute more
?
Technical details
- Node id
n-f49329f1f953477f· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-d23147dfbcf2dc56
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -2)
- 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: 2; 3: 8, 6; 4: 18, 60, 12; 5: 32, 252, 240, 20; 6: 50, 720, 1680, 700, 30; 7: 72, 1650, 7200, 7560, 1680, 42; 8: 98, 3276, 23100, 46200, 26460, 3528, 56; 9: 128, 5880, 61152, 200200, 221760, 77616, 6720, 72; 10: 162, 9792, 141120, 687960, 1261260, 864864, 199584, 11880, 90;
%F FormulaThe row polynomials satisfy (4*n^4-26*n^3+62*n^2-64*n+24)*P(n,x) = (4*n^4-18*n^3+30*n^2-22*n+6+(36*n^4-272*n^3+752*n^2-900*n+396)*x)*P(n-1,x) + ((8*n^3-42*n^2+70*n-38)*x-(52*n^3-294*n^2+516*n-292)*x^2)*d/dx P(n-1,x) - ((5*n^2-14*n+10)*x^2-(20*n^2-56*n+40)*x^3)*d^2/dx^2 P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 2.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^4 - 18*n^3 + 30*n^2 - 22*n + 6 + (36*n^4 - 272*n^3 + 752*n^2 - 900*n + 396)*x)*P[n - 1, x] + ((8*n^3 - 42*n^2 + 70*n - 38)*x - (52*n^3 - 294*n^2 + 516*n - 292)*x^2)*D[P[n - 1, x], x] - ((5*n^2 - 14*n + 10)*x^2 - (20*n^2 - 56*n + 40)*x^3)*D[P[n - 1, x], {x, 2}])/(4*n^4 - 26*n^3 + 62*n^2 - 64*n + 24)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 2; for(n = 3, N, my(i = n); v[i] = ((4*n^4 - 18*n^3 + 30*n^2 - 22*n + 6 + (36*n^4 - 272*n^3 + 752*n^2 - 900*n + 396)*x)*v[i - 1] + ((8*n^3 - 42*n^2 + 70*n - 38)*x - (52*n^3 - 294*n^2 + 516*n - 292)*x^2)*deriv(v[i - 1], x) - ((5*n^2 - 14*n + 10)*x^2 - (20*n^2 - 56*n + 40)*x^3)*deriv(deriv(v[i - 1], x), x))/(4*n^4 - 26*n^3 + 62*n^2 - 64*n + 24)); 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
theta_plus_one of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
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) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
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) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
-
from
reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
-
from
theta_plus_one of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
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