A059364 → basis A013611 → D+1
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(-n - 8\,n x - 16\,n x^{2} + 4\,n^{2} + 24\,n^{2} x + 32\,n^{2} x^{2} - 4\,n^{3} - 16\,n^{3} x - 16\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 2\,n - 8\,n x + 4\,n^{2} + 8\,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 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 7 | 4 | 11 | ||||||
| 2 | 59 | 108 | 32 | 199 | |||||
| 3 | 593 | 1992 | 1904 | 384 | 4873 | ||||
| 4 | 7017 | 35224 | 61040 | 40064 | 6144 | 149489 | |||
| 5 | 96087 | 649244 | 1667440 | 1971264 | 991744 | 122880 | 5498659 | ||
| 6 | 1498611 | 12802868 | 44021200 | 76730304 | 69259264 | 28348416 | 2949120 | 235609783 | |
| 7 | 26262945 | 272181456 | 1178949792 | 2741028864 | 3635079424 | 2662789120 | 920567808 | 82575360 | 11519434769 |
Compute more
?
Technical details
- Node id
n-2eba56c0d02ad420· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-1272df06034c859c
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: 59, 108, 32; 3: 593, 1992, 1904, 384; 4: 7017, 35224, 61040, 40064, 6144; 5: 96087, 649244, 1667440, 1971264, 991744, 122880; 6: 1498611, 12802868, 44021200, 76730304, 69259264, 28348416, 2949120; 7: 26262945, 272181456, 1178949792, 2741028864, 3635079424, 2662789120, 920567808, 82575360; 8: 511334865, 6243048432, 32719081632, 95576972288, 168624232704, 181031473152, 111820193792, 33504362496, 2642411520; 9: 10955901735, 154193491188, 950203408416, 3351881353856, 7415316188928, 10570027889664, 9551245967360, 5107252396032, 1351489683456, 95126814720;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(4*n^3-4*n^2+n+(16*n^3-24*n^2+8*n)*x+(16*n^3-32*n^2+16*n)*x^2)*P(n-2,x) + (4*n^2-2*n-1+(8*n^2-8*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[(-(4*n^3 - 4*n^2 + n + (16*n^3 - 24*n^2 + 8*n)*x + (16*n^3 - 32*n^2 + 16*n)*x^2)*P[n - 2, x] + (4*n^2 - 2*n - 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] = 1; v[2] = 7 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n^3 - 4*n^2 + n + (16*n^3 - 24*n^2 + 8*n)*x + (16*n^3 - 32*n^2 + 16*n)*x^2)*v[i - 2] + (4*n^2 - 2*n - 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 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_A013611 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (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…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
-
from
basis_map_A013611 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..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.