A008288 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-3\,x - 3\,x^{2} + 3\,n x - n x^{3} + 3\,n^{2} x^{2} + n^{3} x^{3}\right)\,P_{n}(x) = \left(8 + 24\,x + 20\,x^{2} + 4\,x^{3} - 4\,n + 3\,n x + 27\,n x^{2} + 20\,n x^{3} + 4\,n x^{4} - 6\,n^{2} x - 7\,n^{2} x^{2} + 7\,n^{2} x^{3} + 4\,n^{2} x^{4} - 2\,n^{3} x^{2} - 3\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(2 + 10\,x + 17\,x^{2} + 11\,x^{3} + 2\,x^{4} + 4\,n x + 18\,n x^{2} + 26\,n x^{3} + 13\,n x^{4} + 2\,n x^{5} + 2\,n^{2} x^{2} + 8\,n^{2} x^{3} + 9\,n^{2} x^{4} + 2\,n^{2} x^{5}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 4 | 6 | ||||||
| 3 | 5 | 20 | 12 | 37 | |||||
| 4 | 12 | 72 | 96 | 32 | 212 | ||||
| 5 | 29 | 232 | 480 | 352 | 80 | 1173 | |||
| 6 | 70 | 700 | 1968 | 2272 | 1120 | 192 | 6322 | ||
| 7 | 169 | 2028 | 7212 | 11424 | 8880 | 3264 | 448 | 33425 | |
| 8 | 408 | 5712 | 24576 | 49600 | 53120 | 30720 | 8960 | 1024 | 174120 |
Compute more
?
Technical details
- Node id
n-2d4959f405bac6b4· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-8b913131e1582cd7
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 -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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 4; 3: 5, 20, 12; 4: 12, 72, 96, 32; 5: 29, 232, 480, 352, 80; 6: 70, 700, 1968, 2272, 1120, 192; 7: 169, 2028, 7212, 11424, 8880, 3264, 448; 8: 408, 5712, 24576, 49600, 53120, 30720, 8960, 1024; 9: 985, 15760, 79584, 195392, 267680, 213504, 97664, 23552, 2304; 10: 2378, 42804, 248160, 718144, 1200960, 1227648, 774144, 291840, 59904, 5120;
%F FormulaThe row polynomials satisfy ((3*n-3)*x+(3*n^2-3)*x^2+(n^3-n)*x^3)*P(n,x) = -(4*n-8+(6*n^2-3*n-24)*x+(2*n^3+7*n^2-27*n-20)*x^2+(3*n^3-7*n^2-20*n-4)*x^3-(4*n^2+4*n)*x^4)*P(n-1,x) + (2+(4*n+10)*x+(2*n^2+18*n+17)*x^2+(8*n^2+26*n+11)*x^3+(9*n^2+13*n+2)*x^4+(2*n^2+2*n)*x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n - 8 + (6*n^2 - 3*n - 24)*x + (2*n^3 + 7*n^2 - 27*n - 20)*x^2 + (3*n^3 - 7*n^2 - 20*n - 4)*x^3 - (4*n^2 + 4*n)*x^4)*P[n - 1, x] + (2 + (4*n + 10)*x + (2*n^2 + 18*n + 17)*x^2 + (8*n^2 + 26*n + 11)*x^3 + (9*n^2 + 13*n + 2)*x^4 + (2*n^2 + 2*n)*x^5)*D[P[n - 1, x], x])/((3*n - 3)*x + (3*n^2 - 3)*x^2 + (n^3 - n)*x^3)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(4*n - 8 + (6*n^2 - 3*n - 24)*x + (2*n^3 + 7*n^2 - 27*n - 20)*x^2 + (3*n^3 - 7*n^2 - 20*n - 4)*x^3 - (4*n^2 + 4*n)*x^4)*v[i - 1] + (2 + (4*n + 10)*x + (2*n^2 + 18*n + 17)*x^2 + (8*n^2 + 26*n + 11)*x^3 + (9*n^2 + 13*n + 2)*x^4 + (2*n^2 + 2*n)*x^5)*deriv(v[i - 1], x))/((3*n - 3)*x + (3*n^2 - 3)*x^2 + (n^3 - n)*x^3)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013609 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
-
from
basis_map_A013609 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
Related ?
Same fingerprint ?
References
- [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.