A304236 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-50\,n - 140\,n x + 96\,n x^{2} - 20\,n^{2} + 96\,n^{2} x + 24\,n^{3}\right)\,P_{n}(x) = \left(276 + 816\,x - 48\,x^{2} - 1152\,x^{3} - 230\,n - 1292\,n x - 1008\,n x^{2} + 1152\,n x^{3} - 260\,n^{2} + 144\,n^{2} x + 1152\,n^{2} x^{2} + 168\,n^{3} + 288\,n^{3} x\right)\,P_{n-1}(x) + \left(-13 - 388\,x - 1972\,x^{2} - 3648\,x^{3} - 2304\,x^{4} - 182\,n - 1324\,n x - 3072\,n x^{2} - 2304\,n x^{3} - 156\,n^{2} - 600\,n^{2} x - 576\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 1 | 1 | |||
| 2 | 10 | 6 | 16 | ||
| 3 | 19 | 12 | 31 | ||
| 4 | 73 | 126 | 36 | 235 | |
| 5 | 172 | 348 | 108 | 628 | |
| 6 | 505 | 1488 | 1188 | 216 | 3397 |
| 7 | 1261 | 4356 | 4248 | 864 | 10729 |
Compute more
?
Technical details
- Node id
n-bc3b39769daa4133· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-a3fb6d37b7e5508a
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 2: 10, 6; 3: 19, 12; 4: 73, 126, 36; 5: 172, 348, 108; 6: 505, 1488, 1188, 216; 7: 1261, 4356, 4248, 864; 8: 3358, 14298, 19980, 9936, 1296; 9: 8443, 41196, 68796, 43200, 6480;
%F FormulaThe row polynomials satisfy (24*n^3-20*n^2-50*n+(96*n^2-140*n)*x+96*n*x^2)*P(n,x) = (168*n^3-260*n^2-230*n+276+(288*n^3+144*n^2-1292*n+816)*x+(1152*n^2-1008*n-48)*x^2+(1152*n-1152)*x^3)*P(n-1,x) - (156*n^2+182*n+13+(600*n^2+1324*n+388)*x+(576*n^2+3072*n+1972)*x^2+(2304*n+3648)*x^3+2304*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((168*n^3 - 260*n^2 - 230*n + 276 + (288*n^3 + 144*n^2 - 1292*n + 816)*x + (1152*n^2 - 1008*n - 48)*x^2 + (1152*n - 1152)*x^3)*P[n - 1, x] - (156*n^2 + 182*n + 13 + (600*n^2 + 1324*n + 388)*x + (576*n^2 + 3072*n + 1972)*x^2 + (2304*n + 3648)*x^3 + 2304*x^4)*D[P[n - 1, x], x])/(24*n^3 - 20*n^2 - 50*n + (96*n^2 - 140*n)*x + 96*n*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((168*n^3 - 260*n^2 - 230*n + 276 + (288*n^3 + 144*n^2 - 1292*n + 816)*x + (1152*n^2 - 1008*n - 48)*x^2 + (1152*n - 1152)*x^3)*v[i - 1] - (156*n^2 + 182*n + 13 + (600*n^2 + 1324*n + 388)*x + (576*n^2 + 3072*n + 1972)*x^2 + (2304*n + 3648)*x^3 + 2304*x^4)*deriv(v[i - 1], x))/(24*n^3 - 20*n^2 - 50*n + (96*n^2 - 140*n)*x + 96*n*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
basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
-
Geometric basis map (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…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Pascal-(1,3,1) array.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Pascal-(1,3,1) array.?
-
from
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…?
-
-
from
basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n…?
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.