A304236 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(52\,n + 76\,n x + 52\,n^{2} x + 24\,n^{2} x^{2} + 24\,n^{3} x^{2}\right)\,P_{n}(x) = \left(-312 - 1392\,x - 1824\,x^{2} - 576\,x^{3} + 364\,n + 1000\,n x + 432\,n x^{2} - 288\,n x^{3} + 520\,n^{2} x + 1272\,n^{2} x^{2} + 576\,n^{2} x^{3} + 168\,n^{3} x^{2} + 288\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-169 - 1144\,x - 2836\,x^{2} - 3024\,x^{3} - 1152\,x^{4} - 338\,n x - 1768\,n x^{2} - 3048\,n x^{3} - 1728\,n x^{4} - 156\,n^{2} x^{2} - 600\,n^{2} x^{3} - 576\,n^{2} x^{4}\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 | 4 | 12 | 16 | ||||||
| 3 | 7 | 24 | 31 | ||||||
| 4 | 19 | 108 | 108 | 235 | |||||
| 5 | 40 | 264 | 324 | 628 | |||||
| 6 | 97 | 816 | 1620 | 864 | 3397 | ||||
| 7 | 217 | 2088 | 4968 | 3456 | 10729 | ||||
| 8 | 508 | 5700 | 17172 | 19008 | 6480 | 48868 | |||
| 9 | 1159 | 14568 | 50868 | 69120 | 32400 | 168115 | |||
| 10 | 2683 | 37764 | 153684 | 263520 | 194400 | 46656 | 698707 | ||
| 11 | 6160 | 95376 | 437400 | 877824 | 810000 | 279936 | 2506696 | ||
| 12 | 14209 | 240864 | 1238328 | 2897856 | 3369600 | 1819584 | 326592 | 9907033 | |
| 13 | 32689 | 600912 | 3408912 | 9030528 | 12383280 | 8491392 | 2286144 | 36233857 | |
| 14 | 75316 | 1494012 | 9291672 | 27630720 | 44226000 | 38211264 | 16003008 | 2239488 | 139171480 |
Compute more
?
Technical details
- Node id
n-7685d05c3fb614e8· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-34977177fd3c37a4
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: 4, 12; 3: 7, 24; 4: 19, 108, 108; 5: 40, 264, 324; 6: 97, 816, 1620, 864; 7: 217, 2088, 4968, 3456; 8: 508, 5700, 17172, 19008, 6480; 9: 1159, 14568, 50868, 69120, 32400;
%F FormulaThe row polynomials satisfy (52*n+(52*n^2+76*n)*x+(24*n^3+24*n^2)*x^2)*P(n,x) = (364*n-312+(520*n^2+1000*n-1392)*x+(168*n^3+1272*n^2+432*n-1824)*x^2+(288*n^3+576*n^2-288*n-576)*x^3)*P(n-1,x) - (169+(338*n+1144)*x+(156*n^2+1768*n+2836)*x^2+(600*n^2+3048*n+3024)*x^3+(576*n^2+1728*n+1152)*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[((364*n - 312 + (520*n^2 + 1000*n - 1392)*x + (168*n^3 + 1272*n^2 + 432*n - 1824)*x^2 + (288*n^3 + 576*n^2 - 288*n - 576)*x^3)*P[n - 1, x] - (169 + (338*n + 1144)*x + (156*n^2 + 1768*n + 2836)*x^2 + (600*n^2 + 3048*n + 3024)*x^3 + (576*n^2 + 1728*n + 1152)*x^4)*D[P[n - 1, x], x])/(52*n + (52*n^2 + 76*n)*x + (24*n^3 + 24*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((364*n - 312 + (520*n^2 + 1000*n - 1392)*x + (168*n^3 + 1272*n^2 + 432*n - 1824)*x^2 + (288*n^3 + 576*n^2 - 288*n - 576)*x^3)*v[i - 1] - (169 + (338*n + 1144)*x + (156*n^2 + 1768*n + 2836)*x^2 + (600*n^2 + 3048*n + 3024)*x^3 + (576*n^2 + 1728*n + 1152)*x^4)*deriv(v[i - 1], x))/(52*n + (52*n^2 + 76*n)*x + (24*n^3 + 24*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
basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
-
Geometric basis map (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_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Pascal-(1,3,1) array.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Pascal-(1,3,1) array.?
-
from
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…?
-
-
from
basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n…?
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.