A128100 → D → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-20 + 4\,x - 4\,x^{2} + 10\,n - 12\,n x + 8\,n x^{2} + 5\,n^{2} x - 5\,n^{2} x^{2} + n^{3} x^{2}\right)\,P_{n}(x) = \left(-70 - 46\,x + 10\,x^{2} + 30\,n - 36\,n x - 41\,n x^{2} + 6\,n x^{3} + 20\,n^{2} x + 4\,n^{2} x^{2} - 8\,n^{2} x^{3} + 3\,n^{3} x^{2} + 2\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-25 - 35\,x - 2\,x^{2} + 8\,x^{3} - 25\,n x - 40\,n x^{2} - 11\,n x^{3} + 4\,n x^{4} - 5\,n^{2} x^{2} - 9\,n^{2} x^{3} - 4\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 0 | |||||||
| 2 | 1 | 1 | ||||||
| 3 | 2 | 2 | ||||||
| 4 | 5 | 4 | 9 | |||||
| 5 | 10 | 12 | 22 | |||||
| 6 | 20 | 36 | 9 | 65 | ||||
| 7 | 38 | 88 | 36 | 162 | ||||
| 8 | 71 | 204 | 126 | 16 | 417 | |||
| 9 | 130 | 444 | 360 | 80 | 1014 | |||
| 10 | 235 | 932 | 945 | 320 | 25 | 2457 | ||
| 11 | 420 | 1896 | 2304 | 1040 | 150 | 5810 | ||
| 12 | 744 | 3768 | 5346 | 3040 | 675 | 36 | 13609 | |
| 13 | 1308 | 7344 | 11916 | 8176 | 2450 | 252 | 31446 | |
| 14 | 2285 | 14088 | 25740 | 20720 | 7875 | 1260 | 49 | 72017 |
Compute more
?
Technical details
- Node id
n-66e4cb37af1e1354· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-fcd0b3f751df5a6d
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: 1; 3: 2; 4: 5, 4; 5: 10, 12; 6: 20, 36, 9; 7: 38, 88, 36; 8: 71, 204, 126, 16; 9: 130, 444, 360, 80;
%F FormulaThe row polynomials satisfy (10*n-20+(5*n^2-12*n+4)*x+(n^3-5*n^2+8*n-4)*x^2)*P(n,x) = (30*n-70+(20*n^2-36*n-46)*x+(3*n^3+4*n^2-41*n+10)*x^2+(2*n^3-8*n^2+6*n)*x^3)*P(n-1,x) - (25+(25*n+35)*x+(5*n^2+40*n+2)*x^2+(9*n^2+11*n-8)*x^3+(4*n^2-4*n)*x^4)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((30*n - 70 + (20*n^2 - 36*n - 46)*x + (3*n^3 + 4*n^2 - 41*n + 10)*x^2 + (2*n^3 - 8*n^2 + 6*n)*x^3)*P[n - 1, x] - (25 + (25*n + 35)*x + (5*n^2 + 40*n + 2)*x^2 + (9*n^2 + 11*n - 8)*x^3 + (4*n^2 - 4*n)*x^4)*D[P[n - 1, x], x])/(10*n - 20 + (5*n^2 - 12*n + 4)*x + (n^3 - 5*n^2 + 8*n - 4)*x^2)]];
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] = 1; for(n = 3, N, my(i = n + 1); v[i] = ((30*n - 70 + (20*n^2 - 36*n - 46)*x + (3*n^3 + 4*n^2 - 41*n + 10)*x^2 + (2*n^3 - 8*n^2 + 6*n)*x^3)*v[i - 1] - (25 + (25*n + 35)*x + (5*n^2 + 40*n + 2)*x^2 + (9*n^2 + 11*n - 8)*x^3 + (4*n^2 - 4*n)*x^4)*deriv(v[i - 1], x))/(10*n - 20 + (5*n^2 - 12*n + 4)*x + (n^3 - 5*n^2 + 8*n - 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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
derivative 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 2 tile…?
-
Laguerre’s theorem on differential operators [SP14] 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…?
-
Laguerre’s theorem on differential operators [SP14] 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…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
derivative of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficient…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficient…?
-
-
from
derivative 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 2 tile…?
References
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [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.