A028338 → basis A013611 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-4 + 16\,x - 16\,x^{2} + 8\,n - 16\,n x - 4\,n^{2}\right)\,P_{n-2}(x) + \left(-2 + 8\,x + 4\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 8\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 8 | 10 | ||||||
| 2 | 8 | 48 | 48 | 104 | |||||
| 3 | 48 | 352 | 576 | 256 | 1232 | ||||
| 4 | 384 | 3200 | 6720 | 5120 | 1280 | 16704 | |||
| 5 | 3840 | 35072 | 86400 | 87040 | 38400 | 6144 | 256896 | ||
| 6 | 46080 | 451584 | 1247232 | 1505280 | 896000 | 258048 | 28672 | 4432896 | |
| 7 | 645120 | 6690816 | 20170752 | 27725824 | 20070400 | 7913472 | 1605632 | 131072 | 84953088 |
Compute more
?
Technical details
- Node id
n-6794e86a8babf0ab· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-6dbaa8a13258baa3
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: 2, 8; 2: 8, 48, 48; 3: 48, 352, 576, 256; 4: 384, 3200, 6720, 5120, 1280; 5: 3840, 35072, 86400, 87040, 38400, 6144; 6: 46080, 451584, 1247232, 1505280, 896000, 258048, 28672; 7: 645120, 6690816, 20170752, 27725824, 20070400, 7913472, 1605632, 131072; 8: 10321920, 112214016, 362876928, 551190528, 459755520, 222953472, 62619648, 9437184, 589824; 9: 185794560, 2102427648, 7205068800, 11856773120, 11031552000, 6219988992, 2167603200, 456130560, 53084160, 2621440;
%F FormulaThe row polynomials satisfy P(n,x) = -(4*n^2-8*n+4+(16*n-16)*x+16*x^2)*P(n-2,x) + (4*n-2+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 8*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 8*n + 4 + (16*n - 16)*x + 16*x^2)*P[n - 2, x] + (4*n - 2 + 8*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] = 2 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(4*n^2 - 8*n + 4 + (16*n - 16)*x + 16*x^2)*v[i - 2] + (4*n - 2 + 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 - 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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013611 of Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
-
-
from
basis_map_A013611 of Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
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.