A169803 → x ↦ x+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + 3\,x + 4\,x^{2} + 3\,n + 7\,n x + 4\,n x^{2} + 5\,n^{2} + 4\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(-1 + 3\,x + 4\,x^{2} + 8\,n + 25\,n x + 26\,n x^{2} + 8\,n x^{3} + 14\,n^{2} + 20\,n^{2} x + 8\,n^{2} x^{2} + 3\,n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(-40 - 127\,x - 151\,x^{2} - 80\,x^{3} - 16\,x^{4} - 30\,n - 74\,n x - 60\,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) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 1 | 4 | ||||||
| 2 | 5 | 2 | 7 | ||||||
| 3 | 10 | 7 | 1 | 18 | |||||
| 4 | 18 | 16 | 3 | 37 | |||||
| 5 | 33 | 38 | 12 | 1 | 84 | ||||
| 6 | 59 | 82 | 34 | 4 | 179 | ||||
| 7 | 105 | 173 | 93 | 18 | 1 | 390 | |||
| 8 | 185 | 352 | 231 | 60 | 5 | 833 | |||
| 9 | 324 | 701 | 548 | 185 | 25 | 1 | 1784 | ||
| 10 | 564 | 1368 | 1242 | 516 | 95 | 6 | 3791 | ||
| 11 | 977 | 2628 | 2724 | 1354 | 325 | 33 | 1 | 8042 | |
| 12 | 1685 | 4980 | 5808 | 3368 | 1001 | 140 | 7 | 16989 | |
| 13 | 2895 | 9329 | 12102 | 8040 | 2870 | 525 | 42 | 1 | 35804 |
| 14 | 4957 | 17302 | 24726 | 18540 | 7750 | 1764 | 196 | 8 | 75243 |
Compute more
?
Technical details
- Node id
n-a749172fd9b39eab· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-1aa2d780018369b6
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 1; 2: 5, 2; 3: 10, 7, 1; 4: 18, 16, 3; 5: 33, 38, 12, 1; 6: 59, 82, 34, 4; 7: 105, 173, 93, 18, 1; 8: 185, 352, 231, 60, 5; 9: 324, 701, 548, 185, 25, 1;
%F FormulaThe row polynomials satisfy (n^3+5*n^2+3*n-1+(4*n^2+7*n+3)*x+(4*n+4)*x^2)*P(n,x) = (3*n^3+14*n^2+8*n-1+(2*n^3+20*n^2+25*n+3)*x+(8*n^2+26*n+4)*x^2+8*n*x^3)*P(n-1,x) - (5*n^2+30*n+40+(9*n^2+74*n+127)*x+(4*n^2+60*n+151)*x^2+(16*n+80)*x^3+16*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[((3*n^3 + 14*n^2 + 8*n - 1 + (2*n^3 + 20*n^2 + 25*n + 3)*x + (8*n^2 + 26*n + 4)*x^2 + 8*n*x^3)*P[n - 1, x] - (5*n^2 + 30*n + 40 + (9*n^2 + 74*n + 127)*x + (4*n^2 + 60*n + 151)*x^2 + (16*n + 80)*x^3 + 16*x^4)*D[P[n - 1, x], x])/(n^3 + 5*n^2 + 3*n - 1 + (4*n^2 + 7*n + 3)*x + (4*n + 4)*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] = ((3*n^3 + 14*n^2 + 8*n - 1 + (2*n^3 + 20*n^2 + 25*n + 3)*x + (8*n^2 + 26*n + 4)*x^2 + 8*n*x^3)*v[i - 1] - (5*n^2 + 30*n + 40 + (9*n^2 + 74*n + 127)*x + (4*n^2 + 60*n + 151)*x^2 + (16*n + 80)*x^3 + 16*x^4)*deriv(v[i - 1], x))/(n^3 + 5*n^2 + 3*n - 1 + (4*n^2 + 7*n + 3)*x + (4*n + 4)*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
shift_x_plus_one of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
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-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.?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
Related ?
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
- [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.