A008277 → 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(-5 - 4\,x - x^{2}\right)\,P_{n-2}(x) + \left(-2 - 3\,x - x^{2}\right)\,P_{n-2}'(x) + \left(5 + 2\,x\right)\,P_{n-1}(x) + \left(1 + x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | 1 | 1 | ||||||
| 3 | 5 | 2 | 7 | |||||
| 4 | 22 | 18 | 3 | 43 | ||||
| 5 | 99 | 122 | 42 | 4 | 267 | |||
| 6 | 471 | 770 | 405 | 80 | 5 | 1731 | ||
| 7 | 2386 | 4832 | 3420 | 1040 | 135 | 6 | 11819 | |
| 8 | 12867 | 30940 | 27468 | 11340 | 2275 | 210 | 7 | 85107 |
Compute more
?
Technical details
- Node id
n-b00309cf6ba339a6· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-80c8c34bda563968
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: 1; 3: 5, 2; 4: 22, 18, 3; 5: 99, 122, 42, 4; 6: 471, 770, 405, 80, 5; 7: 2386, 4832, 3420, 1040, 135, 6; 8: 12867, 30940, 27468, 11340, 2275, 210, 7; 9: 73681, 204430, 217770, 113764, 31150, 4452, 308, 8; 10: 446620, 1400622, 1736787, 1097544, 382515, 74844, 8022, 432, 9;
%F FormulaThe row polynomials satisfy P(n,x) = -(5+4*x+x^2)*P(n-2,x) - (2+3*x+x^2)*d/dx P(n-2,x) + (5+2*x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(5 + 4*x + x^2)*P[n - 2, x] - (2 + 3*x + x^2)*D[P[n - 2, x], x] + (5 + 2*x)*P[n - 1, x] + (1 + 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] = 0; v[2] = 1; for(n = 3, N, my(i = n); v[i] = -(5 + 4*x + x^2)*v[i - 2] - (2 + 3*x + x^2)*deriv(v[i - 2], x) + (5 + 2*x)*v[i - 1] + (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 (−∞, -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)
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
derivative of Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Laguerre’s theorem on differential operators [SP14] 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 differential operators [SP14] polytool ? step ›
-
-
from
derivative of Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
shift_x_plus_one of 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 ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
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.