A086915 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(n + 2\,n x + n^{2}\right)\,P_{n-1}(x) + \left(n x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 4 | 4 | ||||||
| 2 | 24 | 16 | 40 | |||||
| 3 | 144 | 192 | 48 | 384 | ||||
| 4 | 960 | 1920 | 960 | 128 | 3968 | |||
| 5 | 7200 | 19200 | 14400 | 3840 | 320 | 44960 | ||
| 6 | 60480 | 201600 | 201600 | 80640 | 13440 | 768 | 558528 | |
| 7 | 564480 | 2257920 | 2822400 | 1505280 | 376320 | 43008 | 1792 | 7571200 |
Compute more
?
Technical details
- Node id
n-98fbd6b8b374e38e· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-18b5860a7998f46b
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 -1)
- 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: 4; 2: 24, 16; 3: 144, 192, 48; 4: 960, 1920, 960, 128; 5: 7200, 19200, 14400, 3840, 320; 6: 60480, 201600, 201600, 80640, 13440, 768; 7: 564480, 2257920, 2822400, 1505280, 376320, 43008, 1792; 8: 5806080, 27095040, 40642560, 27095040, 9031680, 1548288, 129024, 4096; 9: 65318400, 348364800, 609638400, 487710720, 203212800, 46448640, 5806080, 368640, 9216;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (n^2+n+2*n*x)*P(n-1,x) + n*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + n + 2*n*x)*P[n - 1, x] + n*x*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 4; for(n = 2, N, my(i = n + 1); v[i] = ((n^2 + n + 2*n*x)*v[i - 1] + n*x*deriv(v[i - 1], x))/(n - 1)); 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
Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-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
-
from
Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.