A290319 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-36 + 36\,x - 9\,x^{2} + 48\,n - 24\,n x - 16\,n^{2}\right)\,P_{n-2}(x) + \left(-8 + 6\,x + 8\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 5 | 3 | 8 | ||||||
| 2 | 36 | 42 | 9 | 87 | |||||
| 3 | 396 | 600 | 243 | 27 | 1266 | ||||
| 4 | 5904 | 10416 | 5688 | 1188 | 81 | 23277 | |||
| 5 | 111312 | 217872 | 142920 | 41040 | 5265 | 243 | 518652 | ||
| 6 | 2539584 | 5370336 | 4003056 | 1406160 | 251100 | 21870 | 729 | 13592835 | |
| 7 | 68025024 | 152870400 | 125434512 | 50824368 | 11237940 | 1374408 | 86751 | 2187 | 409855590 |
Compute more
?
Technical details
- Node id
n-da2802966abefa74· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-45397f3818c23e05
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: 5, 3; 2: 36, 42, 9; 3: 396, 600, 243, 27; 4: 5904, 10416, 5688, 1188, 81; 5: 111312, 217872, 142920, 41040, 5265, 243; 6: 2539584, 5370336, 4003056, 1406160, 251100, 21870, 729; 7: 68025024, 152870400, 125434512, 50824368, 11237940, 1374408, 86751, 2187; 8: 2092642560, 4942370304, 4374860544, 1975397760, 509138784, 77783328, 6940080, 332424, 6561; 9: 72706602240, 179039690496, 168625338624, 82978642944, 24045825888, 4315749984, 484254288, 32962464, 1240029, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = -(16*n^2-48*n+36+(24*n-36)*x+9*x^2)*P(n-2,x) + (8*n-8+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(16*n^2 - 48*n + 36 + (24*n - 36)*x + 9*x^2)*P[n - 2, x] + (8*n - 8 + 6*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 5 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = -(16*n^2 - 48*n + 36 + (24*n - 36)*x + 9*x^2)*v[i - 2] + (8*n - 8 + 6*x)*v[i - 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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
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.