A112007 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(1 + 2\,n + n x\right)\,P_{n-1}(x) + \left(-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 | 15 | 10 | 1 | 26 | |||||
| 3 | 105 | 105 | 25 | 1 | 236 | ||||
| 4 | 945 | 1260 | 490 | 56 | 1 | 2752 | |||
| 5 | 10395 | 17325 | 9450 | 1918 | 119 | 1 | 39208 | ||
| 6 | 135135 | 270270 | 190575 | 56980 | 6825 | 246 | 1 | 660032 | |
| 7 | 2027025 | 4729725 | 4099095 | 1636635 | 302995 | 22935 | 501 | 1 | 12818912 |
Compute more
?
Technical details
- Node id
n-fb19feff6ad7c4ad· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-014ae34d4ff839c2
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: 15, 10, 1; 3: 105, 105, 25, 1; 4: 945, 1260, 490, 56, 1; 5: 10395, 17325, 9450, 1918, 119, 1; 6: 135135, 270270, 190575, 56980, 6825, 246, 1; 7: 2027025, 4729725, 4099095, 1636635, 302995, 22935, 501, 1; 8: 34459425, 91891800, 94594500, 47507460, 12122110, 1487200, 74316, 1012, 1; 9: 654729075, 1964187225, 2343240900, 1422280860, 466876410, 81431350, 6914908, 235092, 2035, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (2*n+1+n*x)*P(n-1,x) - (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] - (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] - (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)
- 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
Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.?
Related ?
Same fingerprint ?
- A134991: Triangle of Ward numbers T(n,k) read by rows.
- A163936 → reverse → x ↦ x/(x+1)
- A008517 → x ↦ x/(x+1)
- A163936 → x ↦ x+1
- A269939: Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n…
- A269939 → reverse
References
- [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