A161198 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-9 + 24\,x - 16\,x^{2} + 12\,n - 16\,n x - 4\,n^{2}\right)\,P_{n-2}(x) + \left(-4 + 8\,x + 4\,n\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 7 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 7 | 4 | 11 | ||||||
| 3 | 47 | 64 | 16 | 127 | |||||
| 4 | 389 | 764 | 432 | 64 | 1649 | ||||
| 5 | 3921 | 9568 | 7904 | 2560 | 256 | 24209 | |||
| 6 | 46911 | 132836 | 138400 | 65920 | 14080 | 1024 | 399171 | ||
| 7 | 651423 | 2060576 | 2523184 | 1530880 | 482560 | 73728 | 4096 | 7326447 | |
| 8 | 10311885 | 35579484 | 49178640 | 35390656 | 14309120 | 3232768 | 372736 | 16384 | 148391673 |
Compute more
?
Technical details
- Node id
n-912a05ac2bcf028a· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-db46201f6e55004c
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 -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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 7, 4; 3: 47, 64, 16; 4: 389, 764, 432, 64; 5: 3921, 9568, 7904, 2560, 256; 6: 46911, 132836, 138400, 65920, 14080, 1024; 7: 651423, 2060576, 2523184, 1530880, 482560, 73728, 4096; 8: 10311885, 35579484, 49178640, 35390656, 14309120, 3232768, 372736, 16384; 9: 183410145, 679238208, 1032944064, 845730816, 408364544, 118931456, 20299776, 1835008, 65536; 10: 3622630455, 14234969412, 23403465024, 21224395520, 11731646976, 4101888000, 905920512, 121307136, 8847360, 262144;
%F FormulaThe row polynomials satisfy P(n,x) = -(4*n^2-12*n+9+(16*n-24)*x+16*x^2)*P(n-2,x) + (4*n-4+8*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 7 + 4*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 7 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 12*n + 9 + (16*n - 24)*x + 16*x^2)*P[n - 2, x] + (4*n - 4 + 8*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 7 + 4*x; for(n = 3, N, my(i = n); v[i] = -(4*n^2 - 12*n + 9 + (16*n - 24)*x + 16*x^2)*v[i - 2] + (4*n - 4 + 8*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, 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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
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.