A049374 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 + 6\,n x\right)\,P_{n-1}(x) + \left(-5\,x^{2}\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 | 1 | 6 | 7 | ||||||
| 2 | 1 | 18 | 42 | 61 | |||||
| 3 | 1 | 36 | 276 | 336 | 649 | ||||
| 4 | 1 | 60 | 960 | 4200 | 3024 | 8245 | |||
| 5 | 1 | 90 | 2460 | 23400 | 66024 | 30240 | 122215 | ||
| 6 | 1 | 126 | 5250 | 87360 | 557424 | 1086624 | 332640 | 2069425 | |
| 7 | 1 | 168 | 9912 | 255360 | 2916144 | 13349952 | 18805248 | 3991680 | 39328465 |
Compute more
?
Technical details
- Node id
n-d3ab4b2119e206ba· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-9275643d4265da83
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: 1, 6; 2: 1, 18, 42; 3: 1, 36, 276, 336; 4: 1, 60, 960, 4200, 3024; 5: 1, 90, 2460, 23400, 66024, 30240; 6: 1, 126, 5250, 87360, 557424, 1086624, 332640; 7: 1, 168, 9912, 255360, 2916144, 13349952, 18805248, 3991680; 8: 1, 216, 17136, 632016, 11343024, 95001984, 325854144, 342486144, 51891840; 9: 1, 270, 27720, 1386000, 35991648, 480664800, 3080911680, 8162985600, 6559128576, 726485760;
%F FormulaThe row polynomials satisfy P(n,x) = (1+6*n*x)*P(n-1,x) - 5*x^2*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[(1 + 6*n*x)*P[n - 1, x] - 5*x^2*D[P[n - 1, x], x]];
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] = (1 + 6*n*x)*v[i - 1] - 5*x^2*deriv(v[i - 1], x)); 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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
Related ?
Same fingerprint ?
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
- [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.