A052553 → D → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-3 + 66\,x - 108\,x^{2} + 7\,n - 148\,n x + 216\,n x^{2} - 5\,n^{2} + 105\,n^{2} x - 171\,n^{2} x^{2} + n^{3} - 30\,n^{3} x + 67\,n^{3} x^{2} + 3\,n^{4} x - 13\,n^{4} x^{2} + n^{5} x^{2}\right)\,P_{n}(x) = \left(-2 + 12\,x + 72\,x^{2} - 32\,x^{3} + 5\,n - 34\,n x - 192\,n x^{2} + 104\,n x^{3} - 4\,n^{2} + 36\,n^{2} x + 152\,n^{2} x^{2} - 128\,n^{2} x^{3} + n^{3} - 19\,n^{3} x - 35\,n^{3} x^{2} + 74\,n^{3} x^{3} + 3\,n^{4} x - 2\,n^{4} x^{2} - 20\,n^{4} x^{3} + n^{5} x^{2} + 2\,n^{5} x^{3}\right)\,P_{n-1}(x) + \left(-x + 6\,x^{2} + 36\,x^{3} - 16\,x^{4} + 2\,n x - 14\,n x^{2} - 76\,n x^{3} + 48\,n x^{4} - n^{2} x + 11\,n^{2} x^{2} + 47\,n^{2} x^{3} - 52\,n^{2} x^{4} - 3\,n^{3} x^{2} - 6\,n^{3} x^{3} + 24\,n^{3} x^{4} - n^{4} x^{3} - 4\,n^{4} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 0\)
\(P_{3}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | Pn(1) |
|---|---|---|---|---|
| 1 | 0 | |||
| 2 | 0 | |||
| 3 | 1 | 1 | ||
| 4 | 2 | 2 | ||
| 5 | 3 | 8 | 11 | |
| 6 | 4 | 24 | 28 | |
| 7 | 5 | 48 | 27 | 80 |
| 8 | 6 | 80 | 108 | 194 |
Compute more
?
Technical details
- Node id
n-27abf076aa58a72b· 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 -3)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 0; 2: 0; 3: 1; 4: 2; 5: 3, 8; 6: 4, 24; 7: 5, 48, 27; 8: 6, 80, 108; 9: 7, 120, 270, 64; 10: 8, 168, 540, 320;
%F FormulaThe row polynomials satisfy (n^3-5*n^2+7*n-3+(3*n^4-30*n^3+105*n^2-148*n+66)*x+(n^5-13*n^4+67*n^3-171*n^2+216*n-108)*x^2)*P(n,x) = (n^3-4*n^2+5*n-2+(3*n^4-19*n^3+36*n^2-34*n+12)*x+(n^5-2*n^4-35*n^3+152*n^2-192*n+72)*x^2+(2*n^5-20*n^4+74*n^3-128*n^2+104*n-32)*x^3)*P(n-1,x) - ((n^2-2*n+1)*x+(3*n^3-11*n^2+14*n-6)*x^2+(n^4+6*n^3-47*n^2+76*n-36)*x^3+(4*n^4-24*n^3+52*n^2-48*n+16)*x^4)*d/dx P(n-1,x) for n >= 4, with P(1,x) = 0, P(2,x) = 0, P(3,x) = 1.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 0;
P[3, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^3 - 4*n^2 + 5*n - 2 + (3*n^4 - 19*n^3 + 36*n^2 - 34*n + 12)*x + (n^5 - 2*n^4 - 35*n^3 + 152*n^2 - 192*n + 72)*x^2 + (2*n^5 - 20*n^4 + 74*n^3 - 128*n^2 + 104*n - 32)*x^3)*P[n - 1, x] - ((n^2 - 2*n + 1)*x + (3*n^3 - 11*n^2 + 14*n - 6)*x^2 + (n^4 + 6*n^3 - 47*n^2 + 76*n - 36)*x^3 + (4*n^4 - 24*n^3 + 52*n^2 - 48*n + 16)*x^4)*D[P[n - 1, x], x])/(n^3 - 5*n^2 + 7*n - 3 + (3*n^4 - 30*n^3 + 105*n^2 - 148*n + 66)*x + (n^5 - 13*n^4 + 67*n^3 - 171*n^2 + 216*n - 108)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 0; v[3] = 1; for(n = 4, N, my(i = n); v[i] = ((n^3 - 4*n^2 + 5*n - 2 + (3*n^4 - 19*n^3 + 36*n^2 - 34*n + 12)*x + (n^5 - 2*n^4 - 35*n^3 + 152*n^2 - 192*n + 72)*x^2 + (2*n^5 - 20*n^4 + 74*n^3 - 128*n^2 + 104*n - 32)*x^3)*v[i - 1] - ((n^2 - 2*n + 1)*x + (3*n^3 - 11*n^2 + 14*n - 6)*x^2 + (n^4 + 6*n^3 - 47*n^2 + 76*n - 36)*x^3 + (4*n^4 - 24*n^3 + 52*n^2 - 48*n + 16)*x^4)*deriv(v[i - 1], x))/(n^3 - 5*n^2 + 7*n - 3 + (3*n^4 - 30*n^3 + 105*n^2 - 148*n + 66)*x + (n^5 - 13*n^4 + 67*n^3 - 171*n^2 + 216*n - 108)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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 Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonal…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
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
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ 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
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ 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
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
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…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonal…?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.