A026729 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(14 + 68\,x + 8\,x^{2} - 16\,x^{3} - 2\,n - 100\,n x - 24\,n x^{2} + 16\,n x^{3} - 20\,n^{2} + 32\,n^{2} x + 16\,n^{2} x^{2} + 8\,n^{3}\right)\,P_{n}(x) = \left(30 - 248\,x - 64\,x^{2} + 96\,x^{3} + 32\,x^{4} - 184\,n + 144\,n x + 128\,n x^{2} + 112\,n^{2} - 16\,n^{2} x - 32\,n^{2} x^{2} - 16\,n^{3}\right)\,P_{n-1}(x) + \left(5 - 38\,x - 56\,x^{2} + 144\,x^{3} + 144\,x^{4} + 32\,x^{5} - 30\,n + 8\,n x + 208\,n x^{2} + 160\,n x^{3} + 32\,n x^{4} + 20\,n^{2} + 48\,n^{2} x + 16\,n^{2} x^{2}\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 | 3 | 2 | 5 | ||||||
| 3 | 8 | 14 | 4 | 26 | |||||
| 4 | 17 | 54 | 44 | 8 | 123 | ||||
| 5 | 35 | 158 | 232 | 120 | 16 | 561 | |||
| 6 | 68 | 404 | 868 | 808 | 304 | 32 | 2484 | ||
| 7 | 129 | 948 | 2696 | 3704 | 2496 | 736 | 64 | 10773 | |
| 8 | 239 | 2098 | 7444 | 13624 | 13584 | 7136 | 1728 | 128 | 45981 |
Compute more
?
Technical details
- Node id
n-f09a1f04142f8fd5· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-304b7b37ebb5392c
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: 3, 2; 3: 8, 14, 4; 4: 17, 54, 44, 8; 5: 35, 158, 232, 120, 16; 6: 68, 404, 868, 808, 304, 32; 7: 129, 948, 2696, 3704, 2496, 736, 64; 8: 239, 2098, 7444, 13624, 13584, 7136, 1728, 128; 9: 436, 4450, 18944, 43464, 57936, 45024, 19328, 3968, 256; 10: 785, 9138, 45412, 125480, 210336, 218880, 138816, 50304, 8960, 512;
%F FormulaThe row polynomials satisfy (8*n^3-20*n^2-2*n+14+(32*n^2-100*n+68)*x+(16*n^2-24*n+8)*x^2+(16*n-16)*x^3)*P(n,x) = -(16*n^3-112*n^2+184*n-30+(16*n^2-144*n+248)*x+(32*n^2-128*n+64)*x^2-96*x^3-32*x^4)*P(n-1,x) + (20*n^2-30*n+5+(48*n^2+8*n-38)*x+(16*n^2+208*n-56)*x^2+(160*n+144)*x^3+(32*n+144)*x^4+32*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[(-(16*n^3 - 112*n^2 + 184*n - 30 + (16*n^2 - 144*n + 248)*x + (32*n^2 - 128*n + 64)*x^2 - 96*x^3 - 32*x^4)*P[n - 1, x] + (20*n^2 - 30*n + 5 + (48*n^2 + 8*n - 38)*x + (16*n^2 + 208*n - 56)*x^2 + (160*n + 144)*x^3 + (32*n + 144)*x^4 + 32*x^5)*D[P[n - 1, x], x])/(8*n^3 - 20*n^2 - 2*n + 14 + (32*n^2 - 100*n + 68)*x + (16*n^2 - 24*n + 8)*x^2 + (16*n - 16)*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] = (-(16*n^3 - 112*n^2 + 184*n - 30 + (16*n^2 - 144*n + 248)*x + (32*n^2 - 128*n + 64)*x^2 - 96*x^3 - 32*x^4)*v[i - 1] + (20*n^2 - 30*n + 5 + (48*n^2 + 8*n - 38)*x + (16*n^2 + 208*n - 56)*x^2 + (160*n + 144)*x^3 + (32*n + 144)*x^4 + 32*x^5)*deriv(v[i - 1], x))/(8*n^3 - 20*n^2 - 2*n + 14 + (32*n^2 - 100*n + 68)*x + (16*n^2 - 24*n + 8)*x^2 + (16*n - 16)*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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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 Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
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…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
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…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.