A008277 → θ+2 (shift +1) → reverse → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 + x - x^{2} + n x + n x^{2}\right)\,P_{n-2}(x) + \left(-x - 2\,x^{2} - x^{3}\right)\,P_{n-2}'(x) + \left(1 - x + n + n x\right)\,P_{n-1}(x) + \left(-1 - 2\,x - x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 5 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 2 | 2 | |||||||
| 1 | 5 | 2 | 7 | ||||||
| 2 | 15 | 13 | 2 | 30 | |||||
| 3 | 52 | 72 | 27 | 2 | 153 | ||||
| 4 | 203 | 393 | 247 | 53 | 2 | 898 | |||
| 5 | 877 | 2202 | 1983 | 752 | 103 | 2 | 5919 | ||
| 6 | 4140 | 12850 | 15234 | 8496 | 2179 | 201 | 2 | 43102 | |
| 7 | 21147 | 78488 | 116189 | 86650 | 33610 | 6192 | 395 | 2 | 342673 |
Compute more
?
Technical details
- Node id
n-87b0212127393f6f· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-f58116f4a2b7bfc5
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 0)
- 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: 2; 1: 5, 2; 2: 15, 13, 2; 3: 52, 72, 27, 2; 4: 203, 393, 247, 53, 2; 5: 877, 2202, 1983, 752, 103, 2; 6: 4140, 12850, 15234, 8496, 2179, 201, 2; 7: 21147, 78488, 116189, 86650, 33610, 6192, 395, 2; 8: 115975, 502327, 895619, 842733, 444371, 127627, 17511, 781, 2; 9: 678570, 3366648, 7042695, 8040412, 5407176, 2148120, 474857, 49656, 1551, 2;
%F FormulaThe row polynomials satisfy P(n,x) = (1+(n+1)*x+(n-1)*x^2)*P(n-2,x) - (x+2*x^2+x^3)*d/dx P(n-2,x) + (n+1+(n-1)*x)*P(n-1,x) - (1+2*x+x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 5 + 2*x.
%t MathematicaP[0, x_] := 2;
P[1, x_] := 5 + 2*x;
P[n_, x_] := P[n, x] = Expand[(1 + (n + 1)*x + (n - 1)*x^2)*P[n - 2, x] - (x + 2*x^2 + x^3)*D[P[n - 2, x], x] + (n + 1 + (n - 1)*x)*P[n - 1, x] - (1 + 2*x + x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 5 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (1 + (n + 1)*x + (n - 1)*x^2)*v[i - 2] - (x + 2*x^2 + x^3)*deriv(v[i - 2], x) + (n + 1 + (n - 1)*x)*v[i - 1] - (1 + 2*x + x^2)*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 - 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
-
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 ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
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.