A145324 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(-1 - 3\,n - 4\,n x - 3\,n^{2} - 8\,n^{2} x - 4\,n^{2} x^{2} - n^{3} - 4\,n^{3} x - 4\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(1 + 4\,n + 4\,n x + 2\,n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 7 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 7 | 4 | 11 | |||||||||||||
| 2 | 46 | 82 | 24 | 152 | ||||||||||||
| 3 | 326 | 1050 | 968 | 192 | 2536 | |||||||||||
| 4 | 2556 | 12220 | 20228 | 12752 | 1920 | 49676 | ||||||||||
| 5 | 22212 | 142564 | 348380 | 392864 | 189504 | 23040 | 1118564 | |||||||||
| 6 | 212976 | 1727168 | 5643040 | 9359304 | 8056384 | 3159936 | 322560 | 28481368 | ||||||||
| 7 | 2239344 | 22037184 | 90696864 | 200526984 | 253192384 | 176934784 | 58622976 | 5160960 | 809411480 | |||||||
| 8 | 25659360 | 297722304 | 1483451472 | 4122056736 | 6922720144 | 7082041216 | 4175988480 | 1199720448 | 92897280 | 25402257440 | ||||||
| 9 | 318540960 | 4265031744 | 25011185712 | 83988405536 | 176957151984 | 240374517696 | 207180558080 | 105847538688 | 26874224640 | 1857945600 | 872675100640 | |||||
| 10 | 4261576320 | 64757098368 | 437595867936 | 1726978666976 | 4390949047328 | 7472219364384 | 8540001349760 | 6369910886912 | 2874496260096 | 654403092480 | 40874803200 | 32576448013760 | ||||
| 11 | 61148511360 | 1040649922944 | 7971736918176 | 36210850353248 | 108077240911520 | 221688701242272 | 317047647688064 | 313235397780992 | 206172729845760 | 83390871896064 | 17218041937920 | 980995276800 | 1313096012285120 | |||
| 12 | 937030429440 | 17667870241536 | 151435208836800 | 779047453446976 | 2673726412084608 | 6431819147803456 | 11076862827529792 | 13681241453436672 | 11916965222358016 | 7025081439621120 | 2576319697649664 | 486908901457920 | 25505877196800 | 56843518542092800 | ||
| 13 | 15275952518400 | 316271261594880 | 3001070504722752 | 17261012263142592 | 67038778398411392 | 185290583958969280 | 373934208373935040 | 555722470879290368 | 604669622880262144 | 471366208084492288 | 251785807778660352 | 84504059558756352 | 14730201960284160 | 714164561510400 | 2630349736416550400 | |
| 14 | 264030355814400 | 5957282221102080 | 62030003117317632 | 394710770667889152 | 1712782799413448192 | 5353578970257400960 | 12405156726719960320 | 21588804982036715648 | 28245444958666491904 | 27486507106893549568 | 19403201882133430272 | 9480178415228977152 | 2934186897946705920 | 474757628638003200 | 21424936845312000 | 129568987391142118400 |
Compute more
?
Technical details
- Node id
n-d7afc1bf684a27bb· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-3696a58d23a4e64f
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: 7, 4; 2: 46, 82, 24; 3: 326, 1050, 968, 192; 4: 2556, 12220, 20228, 12752, 1920; 5: 22212, 142564, 348380, 392864, 189504, 23040; 6: 212976, 1727168, 5643040, 9359304, 8056384, 3159936, 322560; 7: 2239344, 22037184, 90696864, 200526984, 253192384, 176934784, 58622976, 5160960; 8: 25659360, 297722304, 1483451472, 4122056736, 6922720144, 7082041216, 4175988480, 1199720448, 92897280; 9: 318540960, 4265031744, 25011185712, 83988405536, 176957151984, 240374517696, 207180558080, 105847538688, 26874224640, 1857945600;
%F FormulaThe row polynomials satisfy n*P(n,x) = -(n^3+3*n^2+3*n+1+(4*n^3+8*n^2+4*n)*x+(4*n^3+4*n^2)*x^2)*P(n-2,x) + (2*n^2+4*n+1+(4*n^2+4*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 7 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + 3*n^2 + 3*n + 1 + (4*n^3 + 8*n^2 + 4*n)*x + (4*n^3 + 4*n^2)*x^2)*P[n - 2, x] + (2*n^2 + 4*n + 1 + (4*n^2 + 4*n)*x)*P[n - 1, x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 7 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + 3*n^2 + 3*n + 1 + (4*n^3 + 8*n^2 + 4*n)*x + (4*n^3 + 4*n^2)*x^2)*v[i - 2] + (2*n^2 + 4*n + 1 + (4*n^2 + 4*n)*x)*v[i - 1])/(n)); 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 Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
- ↑ 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…?
-
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…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
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…?
-
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…?
-
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) (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…?
-
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) (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
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…?
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
-
from
basis_map_A013609 of Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
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.