A008277 → θ+1 → D+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(6 + 10\,x + 5\,x^{2} + x^{3}\right)\,P_{n-3}(x) + \left(2\,x + 3\,x^{2} + x^{3}\right)\,P_{n-3}'(x) + \left(-11 - 11\,x - 3\,x^{2}\right)\,P_{n-2}(x) + \left(-3\,x - 2\,x^{2}\right)\,P_{n-2}'(x) + \left(6 + 3\,x\right)\,P_{n-1}(x) + \left(x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 5 + 2\,x\)
\(P_{3}(x) = 19 + 18\,x + 3\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 5 | 2 | 7 | ||||||
| 3 | 19 | 18 | 3 | 40 | |||||
| 4 | 65 | 110 | 42 | 4 | 221 | ||||
| 5 | 211 | 570 | 375 | 80 | 5 | 1241 | |||
| 6 | 665 | 2702 | 2730 | 980 | 135 | 6 | 7218 | ||
| 7 | 2059 | 12138 | 17703 | 9520 | 2170 | 210 | 7 | 43807 | |
| 8 | 6305 | 52670 | 106722 | 80724 | 27090 | 4284 | 308 | 8 | 278111 |
Compute more
?
Technical details
- Node id
n-8271029ff5f67869· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-306ed4af19c47352
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: 5, 2; 3: 19, 18, 3; 4: 65, 110, 42, 4; 5: 211, 570, 375, 80, 5; 6: 665, 2702, 2730, 980, 135, 6; 7: 2059, 12138, 17703, 9520, 2170, 210, 7; 8: 6305, 52670, 106722, 80724, 27090, 4284, 308, 8; 9: 19171, 223290, 612615, 626640, 290535, 66780, 7770, 432, 9; 10: 58025, 931502, 3398010, 4576660, 2817045, 882882, 147840, 13200, 585, 10;
%F FormulaThe row polynomials satisfy P(n,x) = (6+10*x+5*x^2+x^3)*P(n-3,x) + (2*x+3*x^2+x^3)*d/dx P(n-3,x) - (11+11*x+3*x^2)*P(n-2,x) - (3*x+2*x^2)*d/dx P(n-2,x) + (6+3*x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 4, with P(1,x) = 1, P(2,x) = 5 + 2*x, P(3,x) = 19 + 18*x + 3*x^2.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 5 + 2*x;
P[3, x_] := 19 + 18*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[(6 + 10*x + 5*x^2 + x^3)*P[n - 3, x] + (2*x + 3*x^2 + x^3)*D[P[n - 3, x], x] - (11 + 11*x + 3*x^2)*P[n - 2, x] - (3*x + 2*x^2)*D[P[n - 2, x], x] + (6 + 3*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 5 + 2*x; v[3] = 19 + 18*x + 3*x^2; for(n = 4, N, my(i = n); v[i] = (6 + 10*x + 5*x^2 + x^3)*v[i - 3] + (2*x + 3*x^2 + x^3)*deriv(v[i - 3], x) - (11 + 11*x + 3*x^2)*v[i - 2] - (3*x + 2*x^2)*deriv(v[i - 2], x) + (6 + 3*x)*v[i - 1] + x*deriv(v[i - 1], x)); 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
one_plus_derivative of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of eulerian?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of eulerian?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).?
-
-
from
Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
-
from
one_plus_derivative of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling…?
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [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.