A008277 → θ+1 → D → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-2 - 3\,x + x^{3}\right)\,P_{n-3}(x) + \left(-3 - 6\,x - 3\,x^{2}\right)\,P_{n-3}'(x) + \left(-1 - 3\,x - 3\,x^{2} - x^{3}\right)\,P_{n-3}''(x) + \left(-5 - 6\,x - 3\,x^{2}\right)\,P_{n-2}(x) + \left(2 + 2\,x\right)\,P_{n-2}'(x) + \left(1 + 2\,x + x^{2}\right)\,P_{n-2}''(x) + \left(6 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 2\)
\(P_{3}(x) = 12 + 6\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | 2 | 2 | ||||||
| 3 | 12 | 6 | 18 | |||||
| 4 | 62 | 60 | 12 | 134 | ||||
| 5 | 320 | 450 | 180 | 20 | 970 | |||
| 6 | 1712 | 3120 | 1860 | 420 | 30 | 7142 | ||
| 7 | 9604 | 21336 | 16800 | 5740 | 840 | 42 | 54362 | |
| 8 | 56674 | 147756 | 143892 | 65800 | 14700 | 1512 | 56 | 430390 |
Compute more
?
Technical details
- Node id
n-51062c3aa8b3c844· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-d9103e4f061eeed7
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 0; 2: 2; 3: 12, 6; 4: 62, 60, 12; 5: 320, 450, 180, 20; 6: 1712, 3120, 1860, 420, 30; 7: 9604, 21336, 16800, 5740, 840, 42; 8: 56674, 147756, 143892, 65800, 14700, 1512, 56; 9: 351792, 1048830, 1212372, 693420, 209160, 33012, 2520, 72; 10: 2293862, 7675440, 10239780, 7017780, 2669310, 572040, 67200, 3960, 90;
%F FormulaThe row polynomials satisfy P(n,x) = -(2+3*x-x^3)*P(n-3,x) - (3+6*x+3*x^2)*d/dx P(n-3,x) - (1+3*x+3*x^2+x^3)*d^2/dx^2 P(n-3,x) - (5+6*x+3*x^2)*P(n-2,x) + (2+2*x)*d/dx P(n-2,x) + (1+2*x+x^2)*d^2/dx^2 P(n-2,x) + (6+3*x)*P(n-1,x) for n >= 4, with P(1,x) = 0, P(2,x) = 2, P(3,x) = 12 + 6*x.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 2;
P[3, x_] := 12 + 6*x;
P[n_, x_] := P[n, x] = Expand[-(2 + 3*x - x^3)*P[n - 3, x] - (3 + 6*x + 3*x^2)*D[P[n - 3, x], x] - (1 + 3*x + 3*x^2 + x^3)*D[P[n - 3, x], {x, 2}] - (5 + 6*x + 3*x^2)*P[n - 2, x] + (2 + 2*x)*D[P[n - 2, x], x] + (1 + 2*x + x^2)*D[P[n - 2, x], {x, 2}] + (6 + 3*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 2; v[3] = 12 + 6*x; for(n = 4, N, my(i = n); v[i] = -(2 + 3*x - x^3)*v[i - 3] - (3 + 6*x + 3*x^2)*deriv(v[i - 3], x) - (1 + 3*x + 3*x^2 + x^3)*deriv(deriv(v[i - 3], x), x) - (5 + 6*x + 3*x^2)*v[i - 2] + (2 + 2*x)*deriv(v[i - 2], x) + (1 + 2*x + x^2)*deriv(deriv(v[i - 2], x), x) + (6 + 3*x)*v[i - 1]); 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
derivative of 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 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
derivative of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
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.