A090582 → 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 + 2\,n + n x\right)\,P_{n-1}(x) + \left(-2 - 3\,x - 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 | 13 | 8 | 1 | 22 | |||||
| 3 | 75 | 67 | 17 | 1 | 160 | ||||
| 4 | 541 | 634 | 246 | 34 | 1 | 1456 | |||
| 5 | 4683 | 6793 | 3562 | 798 | 67 | 1 | 15904 | ||
| 6 | 47293 | 81780 | 54111 | 16904 | 2451 | 132 | 1 | 202672 | |
| 7 | 545835 | 1095967 | 876255 | 352371 | 73649 | 7341 | 261 | 1 | 2951680 |
Compute more
?
Technical details
- Node id
n-ec6a6973bfb277d0· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-6c43fbf0495b302d
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: 1; 1: 3, 1; 2: 13, 8, 1; 3: 75, 67, 17, 1; 4: 541, 634, 246, 34, 1; 5: 4683, 6793, 3562, 798, 67, 1; 6: 47293, 81780, 54111, 16904, 2451, 132, 1; 7: 545835, 1095967, 876255, 352371, 73649, 7341, 261, 1; 8: 7087261, 16205198, 15196348, 7487306, 2056690, 306146, 21748, 518, 1; 9: 102247563, 262283125, 282270272, 164793976, 56259206, 11247058, 1239080, 64192, 1031, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (2*n+1+n*x)*P(n-1,x) - (2+3*x+x^2)*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[(2*n + 1 + n*x)*P[n - 1, x] - (2 + 3*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2*n + 1 + n*x)*v[i - 1] - (2 + 3*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
T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= …?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.