A094638 → basis A013610 → D
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(-9\,n x^{2} + 6\,n^{2} x + 18\,n^{2} x^{2} - n^{3} - 6\,n^{3} x - 9\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 6\,n x + 2\,n^{2} + 6\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 3 | 3 | ||||||
| 2 | 21 | 36 | 57 | |||||
| 3 | 138 | 522 | 486 | 1146 | ||||
| 4 | 978 | 5922 | 11826 | 7776 | 26502 | |||
| 5 | 7668 | 64872 | 204201 | 283176 | 145800 | 705717 | ||
| 6 | 66636 | 730152 | 3180951 | 6883056 | 7392060 | 3149280 | 21402135 | |
| 7 | 638928 | 8639928 | 48447396 | 144131076 | 239816700 | 211474152 | 77157360 | 730305540 |
Compute more
?
Technical details
- Node id
n-c5c5d19ad588b4eb· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-2708d889240ab808
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: 3; 2: 21, 36; 3: 138, 522, 486; 4: 978, 5922, 11826, 7776; 5: 7668, 64872, 204201, 283176, 145800; 6: 66636, 730152, 3180951, 6883056, 7392060, 3149280; 7: 638928, 8639928, 48447396, 144131076, 239816700, 211474152, 77157360; 8: 6718032, 108427896, 747063972, 2847496356, 6482282580, 8809988328, 6615692496, 2116316160; 9: 76978080, 1447052688, 11861969508, 55369266552, 160925827815, 298125838872, 343671557292, 225304530048, 64283103360;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(6*n^3-6*n^2)*x+(9*n^3-18*n^2+9*n)*x^2)*P(n-2,x) + (2*n^2-1+(6*n^2-6*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 3.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (6*n^3 - 6*n^2)*x + (9*n^3 - 18*n^2 + 9*n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (6*n^2 - 6*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] = 3; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (6*n^3 - 6*n^2)*x + (9*n^3 - 18*n^2 + 9*n)*x^2)*v[i - 2] + (2*n^2 - 1 + (6*n^2 - 6*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_A013610 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the …?
-
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 ›
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the …?
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.