A100861 → basis A007318 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-1 - x + 2\,n + n x\right)\,P_{n-1}(x) + \left(-8 - 8\,x - 2\,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 | 1 | 1 | |||||||
| 2 | 3 | 1 | 4 | ||||||
| 3 | 7 | 3 | 10 | ||||||
| 4 | 25 | 18 | 3 | 46 | |||||
| 5 | 81 | 70 | 15 | 166 | |||||
| 6 | 331 | 375 | 135 | 15 | 856 | ||||
| 7 | 1303 | 1701 | 735 | 105 | 3844 | ||||
| 8 | 5937 | 9268 | 5250 | 1260 | 105 | 21820 | |||
| 9 | 26785 | 46908 | 30618 | 8820 | 945 | 114076 | |||
| 10 | 133651 | 267165 | 208530 | 78750 | 14175 | 945 | 703216 | ||
| 11 | 669351 | 1473175 | 1289970 | 561330 | 121275 | 10395 | 4125496 | ||
| 12 | 3609673 | 8820966 | 8816445 | 4587660 | 1299375 | 187110 | 10395 | 27331624 | |
| 13 | 19674097 | 52209378 | 57453825 | 33539220 | 10945935 | 1891890 | 135135 | 175849480 | |
| 14 | 113525595 | 328480243 | 401353953 | 267432165 | 104369265 | 23648625 | 2837835 | 135135 | 1241782816 |
Compute more
?
Technical details
- Node id
n-98e164af94aad52d· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-98f5de0f25da5386
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 3, 1; 3: 7, 3; 4: 25, 18, 3; 5: 81, 70, 15; 6: 331, 375, 135, 15; 7: 1303, 1701, 735, 105; 8: 5937, 9268, 5250, 1260, 105; 9: 26785, 46908, 30618, 8820, 945;
%F FormulaThe row polynomials satisfy P(n,x) = (2*n-1+(n-1)*x)*P(n-1,x) - (8+8*x+2*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 - 1)*x)*P[n - 1, x] - (8 + 8*x + 2*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 - 1)*x)*v[i - 1] - (8 + 8*x + 2*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
shift_x_plus_one of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the compl…?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the compl…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
-
from
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph …?
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