A100861 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 - 6\,x + 4\,x^{2} - n + 4\,n x + n^{2}\right)\,P_{n}(x) = \left(-2 - 2\,x + 4\,x^{2} - 8\,x^{3} + n - 2\,n x - 8\,n x^{2} + 8\,n x^{3} - n^{2} + 8\,n^{2} x^{2} + n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(-1 - 6\,x - 16\,x^{2} - 24\,x^{3} - 16\,x^{4} - n - 8\,n x - 20\,n x^{2} - 16\,n x^{3} - n^{2} - 4\,n^{2} x - 4\,n^{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 | 4 | 2 | 6 | ||||||
| 3 | 10 | 6 | 16 | ||||||
| 4 | 34 | 48 | 12 | 94 | |||||
| 5 | 106 | 200 | 60 | 366 | |||||
| 6 | 376 | 1020 | 720 | 120 | 2236 | ||||
| 7 | 1324 | 4452 | 4200 | 840 | 10816 | ||||
| 8 | 5020 | 21056 | 28560 | 13440 | 1680 | 69756 | |||
| 9 | 19324 | 95328 | 160272 | 100800 | 15120 | 390844 | |||
| 10 | 78256 | 451800 | 947520 | 856800 | 302400 | 30240 | 2667016 | ||
| 11 | 323896 | 2125640 | 5243040 | 5876640 | 2772000 | 332640 | 16673856 | ||
| 12 | 1393624 | 10329792 | 29818800 | 41690880 | 28274400 | 7983360 | 665280 | 120156136 | |
| 13 | 6137080 | 50527776 | 165799920 | 272638080 | 229188960 | 86486400 | 8648640 | 819426856 | |
| 14 | 27898144 | 253639568 | 940011072 | 1809007200 | 1896935040 | 1029188160 | 242161920 | 17297280 | 6216138384 |
Compute more
?
Technical details
- Node id
n-913cf18637a4cc4e· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-c9830293e85b16de
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: 4, 2; 3: 10, 6; 4: 34, 48, 12; 5: 106, 200, 60; 6: 376, 1020, 720, 120; 7: 1324, 4452, 4200, 840; 8: 5020, 21056, 28560, 13440, 1680; 9: 19324, 95328, 160272, 100800, 15120;
%F FormulaThe row polynomials satisfy (n^2-n-1+(4*n-6)*x+4*x^2)*P(n,x) = (n^3-n^2+n-2+(2*n^3-2*n-2)*x+(8*n^2-8*n+4)*x^2+(8*n-8)*x^3)*P(n-1,x) - (n^2+n+1+(4*n^2+8*n+6)*x+(4*n^2+20*n+16)*x^2+(16*n+24)*x^3+16*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[((n^3 - n^2 + n - 2 + (2*n^3 - 2*n - 2)*x + (8*n^2 - 8*n + 4)*x^2 + (8*n - 8)*x^3)*P[n - 1, x] - (n^2 + n + 1 + (4*n^2 + 8*n + 6)*x + (4*n^2 + 20*n + 16)*x^2 + (16*n + 24)*x^3 + 16*x^4)*D[P[n - 1, x], x])/(n^2 - n - 1 + (4*n - 6)*x + 4*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] = ((n^3 - n^2 + n - 2 + (2*n^3 - 2*n - 2)*x + (8*n^2 - 8*n + 4)*x^2 + (8*n - 8)*x^3)*v[i - 1] - (n^2 + n + 1 + (4*n^2 + 8*n + 6)*x + (4*n^2 + 20*n + 16)*x^2 + (16*n + 24)*x^3 + 16*x^4)*deriv(v[i - 1], x))/(n^2 - n - 1 + (4*n - 6)*x + 4*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 (−∞, 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_A013609 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_A013609 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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.