A128100 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-9\,n - 13\,n x + 12\,n x^{2} + 12\,n^{2} x + 3\,n^{3}\right)\,P_{n}(x) = \left(24 + 40\,x - 42\,x^{2} - 72\,x^{3} - 36\,n - 101\,n x - 18\,n x^{2} + 72\,n x^{3} - 9\,n^{2} + 42\,n^{2} x + 72\,n^{2} x^{2} + 15\,n^{3} + 18\,n^{3} x\right)\,P_{n-1}(x) + \left(-12 - 100\,x - 283\,x^{2} - 336\,x^{3} - 144\,x^{4} - 36\,n - 174\,n x - 276\,n x^{2} - 144\,n x^{3} - 18\,n^{2} - 51\,n^{2} x - 36\,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 | 6 | 3 | 9 | ||||||
| 3 | 11 | 6 | 17 | ||||||
| 4 | 32 | 39 | 9 | 80 | |||||
| 5 | 69 | 102 | 27 | 198 | |||||
| 6 | 166 | 339 | 189 | 27 | 721 | ||||
| 7 | 367 | 894 | 630 | 108 | 1999 | ||||
| 8 | 828 | 2439 | 2349 | 810 | 81 | 6507 | |||
| 9 | 1817 | 6174 | 7209 | 3240 | 405 | 18845 | |||
| 10 | 3986 | 15507 | 21897 | 13365 | 3240 | 243 | 58238 | ||
| 11 | 8643 | 37734 | 61884 | 46332 | 14985 | 1458 | 171036 | ||
| 12 | 18664 | 90615 | 170505 | 154548 | 67635 | 12393 | 729 | 515089 | |
| 13 | 40045 | 213846 | 453159 | 479520 | 259686 | 64638 | 5103 | 1515997 | |
| 14 | 85566 | 498867 | 1178037 | 1433295 | 941220 | 316386 | 45927 | 2187 | 4501485 |
Compute more
?
Technical details
- Node id
n-643e863efac6926b· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-d6cf8977dac80cd2
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: 6, 3; 3: 11, 6; 4: 32, 39, 9; 5: 69, 102, 27; 6: 166, 339, 189, 27; 7: 367, 894, 630, 108; 8: 828, 2439, 2349, 810, 81; 9: 1817, 6174, 7209, 3240, 405;
%F FormulaThe row polynomials satisfy (3*n^3-9*n+(12*n^2-13*n)*x+12*n*x^2)*P(n,x) = (15*n^3-9*n^2-36*n+24+(18*n^3+42*n^2-101*n+40)*x+(72*n^2-18*n-42)*x^2+(72*n-72)*x^3)*P(n-1,x) - (18*n^2+36*n+12+(51*n^2+174*n+100)*x+(36*n^2+276*n+283)*x^2+(144*n+336)*x^3+144*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[((15*n^3 - 9*n^2 - 36*n + 24 + (18*n^3 + 42*n^2 - 101*n + 40)*x + (72*n^2 - 18*n - 42)*x^2 + (72*n - 72)*x^3)*P[n - 1, x] - (18*n^2 + 36*n + 12 + (51*n^2 + 174*n + 100)*x + (36*n^2 + 276*n + 283)*x^2 + (144*n + 336)*x^3 + 144*x^4)*D[P[n - 1, x], x])/(3*n^3 - 9*n + (12*n^2 - 13*n)*x + 12*n*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] = ((15*n^3 - 9*n^2 - 36*n + 24 + (18*n^3 + 42*n^2 - 101*n + 40)*x + (72*n^2 - 18*n - 42)*x^2 + (72*n - 72)*x^3)*v[i - 1] - (18*n^2 + 36*n + 12 + (51*n^2 + 174*n + 100)*x + (36*n^2 + 276*n + 283)*x^2 + (144*n + 336)*x^3 + 144*x^4)*deriv(v[i - 1], x))/(3*n^3 - 9*n + (12*n^2 - 13*n)*x + 12*n*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_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
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
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X…?
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.