A028246 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in [−2, −1)coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(2 + 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 | 2 | 1 | 3 | ||||||
| 2 | 6 | 7 | 2 | 15 | |||||
| 3 | 26 | 49 | 30 | 6 | 111 | ||||
| 4 | 150 | 391 | 374 | 156 | 24 | 1095 | |||
| 5 | 1082 | 3601 | 4710 | 3030 | 960 | 120 | 13503 | ||
| 6 | 9366 | 37927 | 63062 | 55140 | 26760 | 6840 | 720 | 199815 | |
| 7 | 94586 | 451249 | 911190 | 1009806 | 663600 | 258720 | 55440 | 5040 | 3449631 |
Compute more
?
Technical details
- Node id
n-5d7f56cbbf85a498· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-d2b16266d15b8c0d
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, 7, 2; 3: 26, 49, 30, 6; 4: 150, 391, 374, 156, 24; 5: 1082, 3601, 4710, 3030, 960, 120; 6: 9366, 37927, 63062, 55140, 26760, 6840, 720; 7: 94586, 451249, 911190, 1009806, 663600, 258720, 55440, 5040; 8: 1091670, 5995591, 14250854, 19150236, 15916824, 8381520, 2731680, 504000, 40320; 9: 14174522, 88073041, 240899430, 380739750, 383251680, 254850120, 111978720, 31358880, 5080320, 362880;
%F FormulaThe row polynomials satisfy P(n,x) = (2+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 + 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 + 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 [-2, -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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
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
-
-
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.?
Related ?
Same fingerprint ?
References
- [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