A094638 → D → basis A013611
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-16\,n x^{2} + 8\,n^{2} x + 32\,n^{2} x^{2} - n^{3} - 8\,n^{3} x - 16\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 8\,n x + 2\,n^{2} + 8\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 1 | 1 | |||||||||||||
| 2 | 7 | 16 | 23 | ||||||||||||
| 3 | 46 | 232 | 288 | 566 | |||||||||||
| 4 | 326 | 2632 | 7008 | 6144 | 16110 | ||||||||||
| 5 | 2556 | 28832 | 121008 | 223744 | 153600 | 529740 | |||||||||
| 6 | 22212 | 324512 | 1885008 | 5438464 | 7787520 | 4423680 | 19881396 | ||||||||
| 7 | 212976 | 3839968 | 28709568 | 113881344 | 252646400 | 297050112 | 144506880 | 840847248 | |||||||
| 8 | 2239344 | 48190176 | 442704576 | 2249873664 | 6829071360 | 12375072768 | 12390432768 | 5284823040 | 39622407696 | ||||||
| 9 | 25659360 | 643134528 | 7029315264 | 43748556288 | 169535028480 | 418766610432 | 643657383936 | 562626035712 | 214035333120 | 2060067057120 | |||||
| 10 | 318540960 | 9127228608 | 115910539584 | 856130933248 | 4052313127680 | 12744114081792 | 26622673043456 | 35613223944192 | 27672560271360 | 9512681472000 | 117199053182880 | ||||
| 11 | 4261576320 | 137558347776 | 1993323563136 | 17073656187904 | 95714958860800 | 366891502123008 | 973669932720128 | 1766098817515520 | 2094925308493824 | 1467032902041600 | 460413783244800 | 7243956004674816 | |||
| 12 | 61148511360 | 2197369847808 | 35817407360640 | 349530238483456 | 2268713836464640 | 10282771157981184 | 33203633244250112 | 76372035222634496 | 122603365156257792 | 130800777512878080 | 83444716409978880 | 24108939922636800 | 483472558627285248 | ||
| 13 | 937030429440 | 37122623050752 | 672838551177984 | 7376763582439424 | 54481459211929600 | 285526539607130112 | 1088672315670360064 | 3042452983060889600 | 6184211172711727104 | 8914960871986298880 | 8650030503476330496 | 5071116344355717120 | 1358136948975206400 | 34657676800842686976 | |
| 14 | 15275952518400 | 661786753858560 | 13210878603932928 | 160890065557880832 | 1333595338949703680 | 7944052153148620800 | 34984485322721234944 | 115311822948816388096 | 284437705523511951360 | 518519774937413058560 | 678912047266500968448 | 604504972286798856192 | 328019779125541601280 | 81906105230504755200 | 2656049118140775329280 |
Compute more
?
Technical details
- Node id
n-c82f794c6974cbe9· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-6dec8cea3983a758
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: 1; 2: 7, 16; 3: 46, 232, 288; 4: 326, 2632, 7008, 6144; 5: 2556, 28832, 121008, 223744, 153600; 6: 22212, 324512, 1885008, 5438464, 7787520, 4423680; 7: 212976, 3839968, 28709568, 113881344, 252646400, 297050112, 144506880; 8: 2239344, 48190176, 442704576, 2249873664, 6829071360, 12375072768, 12390432768, 5284823040; 9: 25659360, 643134528, 7029315264, 43748556288, 169535028480, 418766610432, 643657383936, 562626035712, 214035333120;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(8*n^3-8*n^2)*x+(16*n^3-32*n^2+16*n)*x^2)*P(n-2,x) + (2*n^2-1+(8*n^2-8*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (8*n^3 - 8*n^2)*x + (16*n^3 - 32*n^2 + 16*n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (8*n^2 - 8*n)*x)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (8*n^3 - 8*n^2)*x + (16*n^3 - 32*n^2 + 16*n)*x^2)*v[i - 2] + (2*n^2 - 1 + (8*n^2 - 8*n)*x)*v[i - 1])/(n - 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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
derivative of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first k…?
-
Laguerre’s theorem on differential operators [SP14] 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…?
-
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 ›
- ↑ 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…?
- ↑ 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…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first k…?
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.