A249248 → reverse → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + x\right)\,P_{n}(x) = \left(x + 2\,x^{2} + x^{3} + n x + 2\,n x^{2} + n x^{3}\right)\,P_{n-2}(x) + \left(1 + 3\,x + 2\,x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 4 | 7 | ||||||
| 2 | 3 | 13 | 11 | 27 | |||||
| 3 | 3 | 31 | 65 | 38 | 137 | ||||
| 4 | 3 | 52 | 207 | 288 | 131 | 681 | |||
| 5 | 3 | 76 | 515 | 1278 | 1325 | 490 | 3687 | ||
| 6 | 3 | 103 | 1052 | 4121 | 7346 | 6073 | 1897 | 20595 | |
| 7 | 3 | 133 | 1890 | 10953 | 29932 | 41589 | 28563 | 7714 | 120777 |
Compute more
?
Technical details
- Node id
n-7f418cee227cdffe· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-6f72b1b66f13d328
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, 4; 2: 3, 13, 11; 3: 3, 31, 65, 38; 4: 3, 52, 207, 288, 131; 5: 3, 76, 515, 1278, 1325, 490; 6: 3, 103, 1052, 4121, 7346, 6073, 1897; 7: 3, 133, 1890, 10953, 29932, 41589, 28563, 7714; 8: 3, 166, 3110, 25128, 98395, 204656, 232512, 136570, 32501; 9: 3, 202, 4802, 51578, 277081, 810296, 1357034, 1303114, 668411, 142142;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = ((n+1)*x+(2*n+2)*x^2+(n+1)*x^3)*P(n-2,x) + (1+3*x+2*x^2)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(((n + 1)*x + (2*n + 2)*x^2 + (n + 1)*x^3)*P[n - 2, x] + (1 + 3*x + 2*x^2)*P[n - 1, x])/(1 + x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (((n + 1)*x + (2*n + 2)*x^2 + (n + 1)*x^3)*v[i - 2] + (1 + 3*x + 2*x^2)*v[i - 1])/(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, 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 ›
-
from
reversal of Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
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