A008288 → basis A007318 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-1 + 4\,x + 40\,x^{2} + 48\,x^{3} + n - 7\,n x - 36\,n x^{2} - 40\,n x^{3} + 3\,n^{2} x + 8\,n^{2} x^{2} + 8\,n^{2} x^{3}\right)\,P_{n-1}(x) + \left(x + 23\,x^{2} + 68\,x^{3} + 48\,x^{4} - n x - 10\,n x^{2} - 24\,n x^{3} - 16\,n x^{4}\right)\,P_{n-1}'(x) + \left(x^{2} + 9\,x^{3} + 16\,x^{4} + 8\,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 | 1 | 2 | 3 | ||||||
| 3 | 1 | 5 | 5 | 11 | |||||
| 4 | 1 | 8 | 18 | 12 | 39 | ||||
| 5 | 1 | 11 | 40 | 58 | 29 | 139 | |||
| 6 | 1 | 14 | 71 | 164 | 175 | 70 | 495 | ||
| 7 | 1 | 17 | 111 | 357 | 601 | 507 | 169 | 1763 | |
| 8 | 1 | 20 | 160 | 664 | 1550 | 2048 | 1428 | 408 | 6279 |
Compute more
?
Technical details
- Node id
n-9577f69826f076c7· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-f8b12148df73b33e
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: 1, 2; 3: 1, 5, 5; 4: 1, 8, 18, 12; 5: 1, 11, 40, 58, 29; 6: 1, 14, 71, 164, 175, 70; 7: 1, 17, 111, 357, 601, 507, 169; 8: 1, 20, 160, 664, 1550, 2048, 1428, 408; 9: 1, 23, 218, 1112, 3346, 6106, 6632, 3940, 985; 10: 1, 26, 285, 1728, 6394, 15012, 22442, 20680, 10701, 2378;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (n-1+(3*n^2-7*n+4)*x+(8*n^2-36*n+40)*x^2+(8*n^2-40*n+48)*x^3)*P(n-1,x) - ((n-1)*x+(10*n-23)*x^2+(24*n-68)*x^3+(16*n-48)*x^4)*d/dx P(n-1,x) + (x^2+9*x^3+16*x^4+8*x^5)*d^2/dx^2 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[((n - 1 + (3*n^2 - 7*n + 4)*x + (8*n^2 - 36*n + 40)*x^2 + (8*n^2 - 40*n + 48)*x^3)*P[n - 1, x] - ((n - 1)*x + (10*n - 23)*x^2 + (24*n - 68)*x^3 + (16*n - 48)*x^4)*D[P[n - 1, x], x] + (x^2 + 9*x^3 + 16*x^4 + 8*x^5)*D[P[n - 1, x], {x, 2}])/(n - 1)]];
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] = ((n - 1 + (3*n^2 - 7*n + 4)*x + (8*n^2 - 36*n + 40)*x^2 + (8*n^2 - 40*n + 48)*x^3)*v[i - 1] - ((n - 1)*x + (10*n - 23)*x^2 + (24*n - 68)*x^3 + (16*n - 48)*x^4)*deriv(v[i - 1], x) + (x^2 + 9*x^3 + 16*x^4 + 8*x^5)*deriv(deriv(v[i - 1], x), x))/(n - 1)); 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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
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 [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.?
-
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) (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.?
-
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.?
-
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
shift_x_plus_one of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
Related ?
Candidate equalities ?
- A008288 → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
Same fingerprint ?
References
- [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