A130850 → 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\,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 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 1 | 3 | |||||||||||||
| 2 | 6 | 5 | 1 | 12 | ||||||||||||
| 3 | 26 | 29 | 10 | 1 | 66 | |||||||||||
| 4 | 150 | 209 | 101 | 19 | 1 | 480 | ||||||||||
| 5 | 1082 | 1809 | 1126 | 314 | 36 | 1 | 4368 | |||||||||
| 6 | 9366 | 18269 | 13917 | 5158 | 932 | 69 | 1 | 47712 | ||||||||
| 7 | 94586 | 210853 | 190002 | 87919 | 21806 | 2715 | 134 | 1 | 608016 | |||||||
| 8 | 1091670 | 2737769 | 2848477 | 1580997 | 499669 | 88331 | 7863 | 263 | 1 | 8855040 | ||||||
| 9 | 14174522 | 39497657 | 46597894 | 30170960 | 11600686 | 2668982 | 349642 | 22784 | 520 | 1 | 145083648 | |||||
| 10 | 204495126 | 626813813 | 826823669 | 611858224 | 277312388 | 78753322 | 13725218 | 1367464 | 66254 | 1033 | 1 | 2641216512 | ||||
| 11 | 3245265146 | 10851614157 | 15826167490 | 13177070829 | 6880456452 | 2327757354 | 508276308 | 68933490 | 5318754 | 193577 | 2058 | 1 | 52891055616 | |||
| 12 | 56183135190 | 203522409089 | 325176345573 | 300874085719 | 177881541345 | 69894152106 | 18378890466 | 3171358254 | 341183064 | 20653125 | 568361 | 4107 | 1 | 1155444326400 | ||
| 13 | 1053716696762 | 4110690784225 | 7140551306214 | 7268746927766 | 4800140914960 | 2149222859679 | 661785325020 | 139050095508 | 19338759402 | 1673894975 | 80248702 | 1676310 | 8204 | 1 | 27344999497728 | |
| 14 | 21282685940886 | 88957098135437 | 166918627365037 | 185391679982442 | 135266242247996 | 67999882425187 | 24014157650199 | 5958213118284 | 1020575596614 | 116101477347 | 8172098651 | 312416362 | 4963272 | 16397 | 1 | 696933753434112 |
Compute more
?
Technical details
- Node id
n-6064233ba865bfe5· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-179ce8abeeb2cd96
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: 2, 1; 2: 6, 5, 1; 3: 26, 29, 10, 1; 4: 150, 209, 101, 19, 1; 5: 1082, 1809, 1126, 314, 36, 1; 6: 9366, 18269, 13917, 5158, 932, 69, 1; 7: 94586, 210853, 190002, 87919, 21806, 2715, 134, 1; 8: 1091670, 2737769, 2848477, 1580997, 499669, 88331, 7863, 263, 1; 9: 14174522, 39497657, 46597894, 30170960, 11600686, 2668982, 349642, 22784, 520, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (2*n+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 + 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 + 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
Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.?
-
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
Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers …?
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.