A142458 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + 2\,x + x^{2}\right)\,P_{n}(x) = \left(1 + 4\,x + 5\,x^{2} + 2\,x^{3}\right)\,P_{n-1}(x) + \left(3\,x + 9\,x^{2} + 9\,x^{3} + 3\,x^{4}\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 | 1 | 2 | 3 | ||||||
| 2 | 1 | 10 | 10 | 21 | |||||
| 3 | 1 | 42 | 120 | 80 | 243 | ||||
| 4 | 1 | 170 | 1050 | 1760 | 880 | 3861 | |||
| 5 | 1 | 682 | 8200 | 26000 | 30800 | 12320 | 78003 | ||
| 6 | 1 | 2730 | 60810 | 325600 | 686400 | 628320 | 209440 | 1913301 | |
| 7 | 1 | 10922 | 439320 | 3742480 | 12504800 | 19662720 | 14660800 | 4188800 | 55209843 |
Compute more
?
Technical details
- Node id
n-7e2941a6c64b355d· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-72ea6b42576fa2d7
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: 1, 2; 2: 1, 10, 10; 3: 1, 42, 120, 80; 4: 1, 170, 1050, 1760, 880; 5: 1, 682, 8200, 26000, 30800, 12320; 6: 1, 2730, 60810, 325600, 686400, 628320, 209440; 7: 1, 10922, 439320, 3742480, 12504800, 19662720, 14660800, 4188800; 8: 1, 43690, 3129850, 40939360, 203729680, 489670720, 612821440, 385369600, 96342400; 9: 1, 174762, 22127400, 434432400, 3098818800, 10686947040, 19968009600, 20734560000, 11272060800, 2504902400;
%F FormulaThe row polynomials satisfy (1+2*x+x^2)*P(n,x) = (1+4*x+5*x^2+2*x^3)*P(n-1,x) + (3*x+9*x^2+9*x^3+3*x^4)*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[Together[((1 + 4*x + 5*x^2 + 2*x^3)*P[n - 1, x] + (3*x + 9*x^2 + 9*x^3 + 3*x^4)*D[P[n - 1, x], x])/(1 + 2*x + x^2)]];
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] = ((1 + 4*x + 5*x^2 + 2*x^3)*v[i - 1] + (3*x + 9*x^2 + 9*x^3 + 3*x^4)*deriv(v[i - 1], x))/(1 + 2*x + x^2)); 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, 0]
- 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 ›
Related ?
Same fingerprint ?
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