A059364 → θ+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 x^{2} + 2\,n^{2} x + 2\,n^{2} x^{2} - n^{3} - 2\,n^{3} x - n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 2\,n x + 2\,n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 2 | 4 | ||||||
| 2 | 6 | 14 | 6 | 26 | |||||
| 3 | 24 | 92 | 87 | 24 | 227 | ||||
| 4 | 120 | 652 | 987 | 584 | 120 | 2463 | |||
| 5 | 720 | 5112 | 10812 | 10084 | 4370 | 720 | 31818 | ||
| 6 | 5040 | 44424 | 121692 | 157084 | 106220 | 36504 | 5040 | 476004 | |
| 7 | 40320 | 425952 | 1439988 | 2392464 | 2224245 | 1184280 | 338436 | 40320 | 8086005 |
Compute more
?
Technical details
- Node id
n-31270249172ef2fe· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-d28163317426c881
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, 2; 2: 6, 14, 6; 3: 24, 92, 87, 24; 4: 120, 652, 987, 584, 120; 5: 720, 5112, 10812, 10084, 4370, 720; 6: 5040, 44424, 121692, 157084, 106220, 36504, 5040; 7: 40320, 425952, 1439988, 2392464, 2224245, 1184280, 338436, 40320; 8: 362880, 4478688, 18071316, 36892048, 43942845, 32011272, 14099204, 3457152, 362880; 9: 3628800, 51318720, 241175448, 585776272, 854463990, 794695446, 477110396, 179591904, 38632464, 3628800;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(2*n^3-2*n^2)*x+(n^3-2*n^2+n)*x^2)*P(n-2,x) + (2*n^2-1+(2*n^2-2*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (2*n^3 - 2*n^2)*x + (n^3 - 2*n^2 + n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (2*n^2 - 2*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] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (2*n^3 - 2*n^2)*x + (n^3 - 2*n^2 + n)*x^2)*v[i - 2] + (2*n^2 - 1 + (2*n^2 - 2*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 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
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.?
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.