A169803 → D → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 - 2\,x - n + 8\,n x + n^{2} - 3\,n^{2} x - n^{2} x^{2} + n^{3} - 6\,n^{3} x + 3\,n^{3} x^{2} + 3\,n^{4} x - 3\,n^{4} x^{2} + n^{5} x^{2}\right)\,P_{n}(x) = \left(-16\,x + 16\,x^{2} + n - 22\,n x + 12\,n x^{2} + 2\,n^{2} - 6\,n^{2} x - 26\,n^{2} x^{2} - 4\,n^{2} x^{3} + n^{3} + 5\,n^{3} x - 11\,n^{3} x^{2} - 6\,n^{3} x^{3} + 3\,n^{4} x + 8\,n^{4} x^{2} + n^{5} x^{2} + 2\,n^{5} x^{3}\right)\,P_{n-1}(x) + \left(-x - 2\,x^{2} + 8\,x^{3} - 2\,n x - 6\,n x^{2} + 8\,n x^{3} - n^{2} x - 7\,n^{2} x^{2} - 13\,n^{2} x^{3} - 4\,n^{2} x^{4} - 3\,n^{3} x^{2} - 14\,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) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 1 | 1 | ||||||
| 2 | 2 | 2 | ||||||
| 3 | 3 | 8 | 11 | |||||
| 4 | 4 | 24 | 28 | |||||
| 5 | 5 | 48 | 27 | 80 | ||||
| 6 | 6 | 80 | 108 | 194 | ||||
| 7 | 7 | 120 | 270 | 64 | 461 | |||
| 8 | 8 | 168 | 540 | 320 | 1036 | |||
| 9 | 9 | 224 | 945 | 960 | 125 | 2263 | ||
| 10 | 10 | 288 | 1512 | 2240 | 750 | 4800 | ||
| 11 | 11 | 360 | 2268 | 4480 | 2625 | 216 | 9960 | |
| 12 | 12 | 440 | 3240 | 8064 | 7000 | 1512 | 20268 | |
| 13 | 13 | 528 | 4455 | 13440 | 15750 | 6048 | 343 | 40577 |
| 14 | 14 | 624 | 5940 | 21120 | 31500 | 18144 | 2744 | 80086 |
Compute more
?
Technical details
- Node id
n-afcfdc89e46e8d20· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-66e6f7e007ec6615
Observed on the stored rows ?
- Degrees: -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6 (half affine: slope 1, intercept -1)
- 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: 1; 2: 2; 3: 3, 8; 4: 4, 24; 5: 5, 48, 27; 6: 6, 80, 108; 7: 7, 120, 270, 64; 8: 8, 168, 540, 320; 9: 9, 224, 945, 960, 125;
%F FormulaThe row polynomials satisfy (n^3+n^2-n-1+(3*n^4-6*n^3-3*n^2+8*n-2)*x+(n^5-3*n^4+3*n^3-n^2)*x^2)*P(n,x) = (n^3+2*n^2+n+(3*n^4+5*n^3-6*n^2-22*n-16)*x+(n^5+8*n^4-11*n^3-26*n^2+12*n+16)*x^2+(2*n^5-6*n^3-4*n^2)*x^3)*P(n-1,x) - ((n^2+2*n+1)*x+(3*n^3+7*n^2+6*n+2)*x^2+(n^4+14*n^3+13*n^2-8*n-8)*x^3+(4*n^4+8*n^3+4*n^2)*x^4)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^3 + 2*n^2 + n + (3*n^4 + 5*n^3 - 6*n^2 - 22*n - 16)*x + (n^5 + 8*n^4 - 11*n^3 - 26*n^2 + 12*n + 16)*x^2 + (2*n^5 - 6*n^3 - 4*n^2)*x^3)*P[n - 1, x] - ((n^2 + 2*n + 1)*x + (3*n^3 + 7*n^2 + 6*n + 2)*x^2 + (n^4 + 14*n^3 + 13*n^2 - 8*n - 8)*x^3 + (4*n^4 + 8*n^3 + 4*n^2)*x^4)*D[P[n - 1, x], x])/(n^3 + n^2 - n - 1 + (3*n^4 - 6*n^3 - 3*n^2 + 8*n - 2)*x + (n^5 - 3*n^4 + 3*n^3 - n^2)*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] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((n^3 + 2*n^2 + n + (3*n^4 + 5*n^3 - 6*n^2 - 22*n - 16)*x + (n^5 + 8*n^4 - 11*n^3 - 26*n^2 + 12*n + 16)*x^2 + (2*n^5 - 6*n^3 - 4*n^2)*x^3)*v[i - 1] - ((n^2 + 2*n + 1)*x + (3*n^3 + 7*n^2 + 6*n + 2)*x^2 + (n^4 + 14*n^3 + 13*n^2 - 8*n - 8)*x^3 + (4*n^4 + 8*n^3 + 4*n^2)*x^4)*deriv(v[i - 1], x))/(n^3 + n^2 - n - 1 + (3*n^4 - 6*n^3 - 3*n^2 + 8*n - 2)*x + (n^5 - 3*n^4 + 3*n^3 - n^2)*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) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
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-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.?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
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.