A128100 → D → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(6 + 18\,x - 8\,x^{2} + n - 17\,n x + 4\,n x^{2} - 4\,n^{2} + 4\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(3 + 39\,x + 2\,x^{2} - 24\,x^{3} + 8\,n - 35\,n x - 22\,n x^{2} + 8\,n x^{3} - 12\,n^{2} + 2\,n^{2} x + 8\,n^{2} x^{2} + 3\,n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(5\,x - 11\,x^{2} - 32\,x^{3} - 16\,x^{4} - 20\,n x - 36\,n x^{2} - 16\,n x^{3} - 5\,n^{2} - 9\,n^{2} x - 4\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 0 | |||||||
| 2 | 1 | 1 | ||||||
| 3 | 2 | 2 | ||||||
| 4 | 7 | 2 | 9 | |||||
| 5 | 16 | 6 | 22 | |||||
| 6 | 38 | 24 | 3 | 65 | ||||
| 7 | 82 | 68 | 12 | 162 | ||||
| 8 | 173 | 186 | 54 | 4 | 417 | |||
| 9 | 352 | 462 | 180 | 20 | 1014 | |||
| 10 | 701 | 1096 | 555 | 100 | 5 | 2457 | ||
| 11 | 1368 | 2484 | 1548 | 380 | 30 | 5810 | ||
| 12 | 2628 | 5448 | 4062 | 1300 | 165 | 6 | 13609 | |
| 13 | 4980 | 11616 | 10104 | 4004 | 700 | 42 | 31446 | |
| 14 | 9329 | 24204 | 24120 | 11480 | 2625 | 252 | 7 | 72017 |
Compute more
?
Technical details
- Node id
n-7b8a092f0ea30e10· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-27cf973ee2fcb5a7
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
- 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: 0; 2: 1; 3: 2; 4: 7, 2; 5: 16, 6; 6: 38, 24, 3; 7: 82, 68, 12; 8: 173, 186, 54, 4; 9: 352, 462, 180, 20;
%F FormulaThe row polynomials satisfy (n^3-4*n^2+n+6+(4*n^2-17*n+18)*x+(4*n-8)*x^2)*P(n,x) = (3*n^3-12*n^2+8*n+3+(2*n^3+2*n^2-35*n+39)*x+(8*n^2-22*n+2)*x^2+(8*n-24)*x^3)*P(n-1,x) - (5*n^2+(9*n^2+20*n-5)*x+(4*n^2+36*n+11)*x^2+(16*n+32)*x^3+16*x^4)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((3*n^3 - 12*n^2 + 8*n + 3 + (2*n^3 + 2*n^2 - 35*n + 39)*x + (8*n^2 - 22*n + 2)*x^2 + (8*n - 24)*x^3)*P[n - 1, x] - (5*n^2 + (9*n^2 + 20*n - 5)*x + (4*n^2 + 36*n + 11)*x^2 + (16*n + 32)*x^3 + 16*x^4)*D[P[n - 1, x], x])/(n^3 - 4*n^2 + n + 6 + (4*n^2 - 17*n + 18)*x + (4*n - 8)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = ((3*n^3 - 12*n^2 + 8*n + 3 + (2*n^3 + 2*n^2 - 35*n + 39)*x + (8*n^2 - 22*n + 2)*x^2 + (8*n - 24)*x^3)*v[i - 1] - (5*n^2 + (9*n^2 + 20*n - 5)*x + (4*n^2 + 36*n + 11)*x^2 + (16*n + 32)*x^3 + 16*x^4)*deriv(v[i - 1], x))/(n^3 - 4*n^2 + n + 6 + (4*n^2 - 17*n + 18)*x + (4*n - 8)*x^2)); 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
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
derivative of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tile…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
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
delannoy?
- ↑ 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
delannoy?
- ↑ 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
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (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)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
derivative of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficient…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficient…?
-
-
from
derivative of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tile…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.