A011973 → D → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4\,x - 8\,x^{2} - 16\,n x + 28\,n x^{2} - 2\,n^{2} + 33\,n^{2} x - 38\,n^{2} x^{2} + n^{3} - 18\,n^{3} x + 25\,n^{3} x^{2} + 3\,n^{4} x - 8\,n^{4} x^{2} + n^{5} x^{2}\right)\,P_{n}(x) = \left(-2\,x - 4\,x^{2} - 7\,n x + 4\,n x^{2} - n^{2} - 3\,n^{2} x + 45\,n^{2} x^{2} - 6\,n^{2} x^{3} + n^{3} - 7\,n^{3} x - 33\,n^{3} x^{2} + 14\,n^{3} x^{3} + 3\,n^{4} x + 3\,n^{4} x^{2} - 10\,n^{4} x^{3} + n^{5} x^{2} + 2\,n^{5} x^{3}\right)\,P_{n-1}(x) + \left(-n x^{2} - 4\,n x^{3} - n^{2} x + 2\,n^{2} x^{2} + 23\,n^{2} x^{3} - 4\,n^{2} x^{4} - 3\,n^{3} x^{2} - 10\,n^{3} x^{3} + 8\,n^{3} x^{4} - n^{4} x^{3} - 4\,n^{4} 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 | 3 | 8 | 11 | |||||
| 5 | 4 | 24 | 28 | |||||
| 6 | 5 | 48 | 27 | 80 | ||||
| 7 | 6 | 80 | 108 | 194 | ||||
| 8 | 7 | 120 | 270 | 64 | 461 | |||
| 9 | 8 | 168 | 540 | 320 | 1036 | |||
| 10 | 9 | 224 | 945 | 960 | 125 | 2263 | ||
| 11 | 10 | 288 | 1512 | 2240 | 750 | 4800 | ||
| 12 | 11 | 360 | 2268 | 4480 | 2625 | 216 | 9960 | |
| 13 | 12 | 440 | 3240 | 8064 | 7000 | 1512 | 20268 | |
| 14 | 13 | 528 | 4455 | 13440 | 15750 | 6048 | 343 | 40577 |
Compute more
?
Technical details
- Node id
n-8382f0c2d250c6e5· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-66e6f7e007ec6615
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: 3, 8; 5: 4, 24; 6: 5, 48, 27; 7: 6, 80, 108; 8: 7, 120, 270, 64; 9: 8, 168, 540, 320;
%F FormulaThe row polynomials satisfy (n^3-2*n^2+(3*n^4-18*n^3+33*n^2-16*n-4)*x+(n^5-8*n^4+25*n^3-38*n^2+28*n-8)*x^2)*P(n,x) = (n^3-n^2+(3*n^4-7*n^3-3*n^2-7*n-2)*x+(n^5+3*n^4-33*n^3+45*n^2+4*n-4)*x^2+(2*n^5-10*n^4+14*n^3-6*n^2)*x^3)*P(n-1,x) - (n^2*x+(3*n^3-2*n^2+n)*x^2+(n^4+10*n^3-23*n^2+4*n)*x^3+(4*n^4-8*n^3+4*n^2)*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[((n^3 - n^2 + (3*n^4 - 7*n^3 - 3*n^2 - 7*n - 2)*x + (n^5 + 3*n^4 - 33*n^3 + 45*n^2 + 4*n - 4)*x^2 + (2*n^5 - 10*n^4 + 14*n^3 - 6*n^2)*x^3)*P[n - 1, x] - (n^2*x + (3*n^3 - 2*n^2 + n)*x^2 + (n^4 + 10*n^3 - 23*n^2 + 4*n)*x^3 + (4*n^4 - 8*n^3 + 4*n^2)*x^4)*D[P[n - 1, x], x])/(n^3 - 2*n^2 + (3*n^4 - 18*n^3 + 33*n^2 - 16*n - 4)*x + (n^5 - 8*n^4 + 25*n^3 - 38*n^2 + 28*n - 8)*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] = ((n^3 - n^2 + (3*n^4 - 7*n^3 - 3*n^2 - 7*n - 2)*x + (n^5 + 3*n^4 - 33*n^3 + 45*n^2 + 4*n - 4)*x^2 + (2*n^5 - 10*n^4 + 14*n^3 - 6*n^2)*x^3)*v[i - 1] - (n^2*x + (3*n^3 - 2*n^2 + n)*x^2 + (n^4 + 10*n^3 - 23*n^2 + 4*n)*x^3 + (4*n^4 - 8*n^3 + 4*n^2)*x^4)*deriv(v[i - 1], x))/(n^3 - 2*n^2 + (3*n^4 - 18*n^3 + 33*n^2 - 16*n - 4)*x + (n^5 - 8*n^4 + 25*n^3 - 38*n^2 + 28*n - 8)*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 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 ›
-
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…?
-
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…?
Related ?
Same fingerprint ?
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.