A100861 → basis A013610 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-6 + 3\,n\right)\,P_{n}(x) = \left(-6\,n - 27\,n x + 3\,n^{2} + 9\,n^{2} x\right)\,P_{n-1}(x) + \left(-2\,n - 12\,n x - 18\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 0 | |||||||
| 2 | 3 | 3 | ||||||
| 3 | 9 | 9 | ||||||
| 4 | 36 | 54 | 90 | |||||
| 5 | 120 | 270 | 390 | |||||
| 6 | 450 | 1620 | 1215 | 3285 | ||||
| 7 | 1638 | 7560 | 8505 | 17703 | ||||
| 8 | 6384 | 37800 | 68040 | 34020 | 146244 | |||
| 9 | 25056 | 176904 | 408240 | 306180 | 916380 | |||
| 10 | 103140 | 861840 | 2551500 | 3061800 | 1148175 | 7726455 | ||
| 11 | 432300 | 4134240 | 14594580 | 22453200 | 12629925 | 54244245 | ||
| 12 | 1880208 | 20421720 | 85322160 | 168399000 | 151559100 | 45467730 | 473049918 | |
| 13 | 8352864 | 101158200 | 483706080 | 1138377240 | 1313512200 | 591080490 | 3636187074 | |
| 14 | 38261496 | 513296784 | 2787564780 | 7764316560 | 11493231750 | 8275126860 | 2068781715 | 32940579945 |
Compute more
?
Technical details
- Node id
n-982f18cab0c327bf· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-6d568a62896b03a0
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
- 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: 0; 1: 0; 2: 3; 3: 9; 4: 36, 54; 5: 120, 270; 6: 450, 1620, 1215; 7: 1638, 7560, 8505; 8: 6384, 37800, 68040, 34020; 9: 25056, 176904, 408240, 306180;
%F FormulaThe row polynomials satisfy (3*n-6)*P(n,x) = (3*n^2-6*n+(9*n^2-27*n)*x)*P(n-1,x) - (2*n+12*n*x+18*n*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 3.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((3*n^2 - 6*n + (9*n^2 - 27*n)*x)*P[n - 1, x] - (2*n + 12*n*x + 18*n*x^2)*D[P[n - 1, x], x])/(3*n - 6)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 3; for(n = 3, N, my(i = n + 1); v[i] = ((3*n^2 - 6*n + (9*n^2 - 27*n)*x)*v[i - 1] - (2*n + 12*n*x + 18*n*x^2)*deriv(v[i - 1], x))/(3*n - 6)); 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013610 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph…?
-
Geometric basis map (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).?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013610 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.