A137320 → basis A013609 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-16\,x^{2} - 8\,n x - n^{2}\right)\,P_{n-2}(x) + \left(1 + 8\,x + 2\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 4 | 4 | |||||||||||||
| 2 | 20 | 32 | 52 | ||||||||||||
| 3 | 104 | 288 | 192 | 584 | |||||||||||
| 4 | 616 | 2272 | 2688 | 1024 | 6600 | ||||||||||
| 5 | 4176 | 18560 | 29760 | 20480 | 5120 | 78096 | |||||||||
| 6 | 32112 | 163328 | 319680 | 302080 | 138240 | 24576 | 980016 | ||||||||
| 7 | 277056 | 1563520 | 3537408 | 4121600 | 2616320 | 860160 | 114688 | 13090752 | |||||||
| 8 | 2654784 | 16288128 | 41217792 | 55960576 | 44154880 | 20299776 | 5046272 | 524288 | 186146496 | ||||||
| 9 | 27999360 | 184119552 | 509906688 | 779433984 | 721351680 | 414941184 | 145195008 | 28311552 | 2359296 | 2813618304 | |||||
| 10 | 322508160 | 2249309952 | 6713690880 | 11293276160 | 11832038400 | 8026841088 | 3533537280 | 975175680 | 153354240 | 10485760 | 45110217600 | ||||
| 11 | 4029765120 | 29571784704 | 94060150272 | 171325665280 | 198450841600 | 153115877376 | 79861039104 | 27855421440 | 6228541440 | 807403520 | 46137344 | 765352627200 | |||
| 12 | 54302952960 | 416671322112 | 1400212661760 | 2728887783424 | 3436489267200 | 2943070445568 | 1752734269440 | 727199514624 | 206320435200 | 38178652160 | 4152360960 | 201326592 | 13708420992000 | ||
| 13 | 785149424640 | 6267822133248 | 22103005197312 | 45672229830656 | 61755288657920 | 57698134720512 | 38272608518144 | 18193292722176 | 6160883908608 | 1451480842240 | 226119122944 | 20937965568 | 872415232 | 258607825459200 | |
| 14 | 12125954534400 | 100298527395840 | 369152010759168 | 802966141845504 | 1154690479022080 | 1161897406365696 | 843347089801216 | 447859886915584 | 174283075878912 | 49153918894080 | 9778302550016 | 1300771110912 | 103817412608 | 3758096384 | 5126961140582400 |
Compute more
?
Technical details
- Node id
n-7fd1278b59a5838a· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-a7b8cffa591f9e51
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: 20, 32; 3: 104, 288, 192; 4: 616, 2272, 2688, 1024; 5: 4176, 18560, 29760, 20480, 5120; 6: 32112, 163328, 319680, 302080, 138240, 24576; 7: 277056, 1563520, 3537408, 4121600, 2616320, 860160, 114688; 8: 2654784, 16288128, 41217792, 55960576, 44154880, 20299776, 5046272, 524288; 9: 27999360, 184119552, 509906688, 779433984, 721351680, 414941184, 145195008, 28311552, 2359296;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^2+8*n*x+16*x^2)*P(n-2,x) + (2*n+1+8*x)*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[-(n^2 + 8*n*x + 16*x^2)*P[n - 2, x] + (2*n + 1 + 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] = 0; v[2] = 4; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 8*n*x + 16*x^2)*v[i - 2] + (2*n + 1 + 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 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
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
from
basis_map_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 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
- [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.