A026729 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-30 - 72\,x + 30\,n + 27\,n x - 54\,n x^{2} + 45\,n^{2} x + 27\,n^{2} x^{2} + 27\,n^{3} x^{2}\right)\,P_{n}(x) = \left(150 + 360\,x + 162\,x^{2} - 60\,n + 261\,n x + 675\,n x^{2} + 324\,n x^{3} - 135\,n^{2} x + 27\,n^{2} x^{2} + 162\,n^{2} x^{3} - 54\,n^{3} x^{2}\right)\,P_{n-1}(x) + \left(25 + 135\,x + 207\,x^{2} + 81\,x^{3} + 75\,n x + 360\,n x^{2} + 459\,n x^{3} + 162\,n x^{4} + 45\,n^{2} x^{2} + 162\,n^{2} x^{3} + 81\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 6 | 7 | ||||||
| 3 | 2 | 18 | 27 | 47 | |||||
| 4 | 3 | 42 | 135 | 108 | 288 | ||||
| 5 | 5 | 90 | 432 | 756 | 405 | 1688 | |||
| 6 | 8 | 180 | 1161 | 3132 | 3645 | 1458 | 9584 | ||
| 7 | 13 | 348 | 2808 | 10260 | 18630 | 16038 | 5103 | 53200 | |
| 8 | 21 | 654 | 6345 | 29268 | 72495 | 97686 | 66339 | 17496 | 290304 |
Compute more
?
Technical details
- Node id
n-21eb87379f43dd61· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-a636c51e6eaf8091
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 6; 3: 2, 18, 27; 4: 3, 42, 135, 108; 5: 5, 90, 432, 756, 405; 6: 8, 180, 1161, 3132, 3645, 1458; 7: 13, 348, 2808, 10260, 18630, 16038, 5103; 8: 21, 654, 6345, 29268, 72495, 97686, 66339, 17496; 9: 34, 1206, 13662, 76140, 239355, 441774, 469476, 262440, 59049; 10: 55, 2190, 28377, 185436, 707130, 1662120, 2423925, 2117016, 1003833, 196830;
%F FormulaThe row polynomials satisfy (30*n-30+(45*n^2+27*n-72)*x+(27*n^3+27*n^2-54*n)*x^2)*P(n,x) = -(60*n-150+(135*n^2-261*n-360)*x+(54*n^3-27*n^2-675*n-162)*x^2-(162*n^2+324*n)*x^3)*P(n-1,x) + (25+(75*n+135)*x+(45*n^2+360*n+207)*x^2+(162*n^2+459*n+81)*x^3+(81*n^2+162*n)*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(60*n - 150 + (135*n^2 - 261*n - 360)*x + (54*n^3 - 27*n^2 - 675*n - 162)*x^2 - (162*n^2 + 324*n)*x^3)*P[n - 1, x] + (25 + (75*n + 135)*x + (45*n^2 + 360*n + 207)*x^2 + (162*n^2 + 459*n + 81)*x^3 + (81*n^2 + 162*n)*x^4)*D[P[n - 1, x], x])/(30*n - 30 + (45*n^2 + 27*n - 72)*x + (27*n^3 + 27*n^2 - 54*n)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(60*n - 150 + (135*n^2 - 261*n - 360)*x + (54*n^3 - 27*n^2 - 675*n - 162)*x^2 - (162*n^2 + 324*n)*x^3)*v[i - 1] + (25 + (75*n + 135)*x + (45*n^2 + 360*n + 207)*x^2 + (162*n^2 + 459*n + 81)*x^3 + (81*n^2 + 162*n)*x^4)*deriv(v[i - 1], x))/(30*n - 30 + (45*n^2 + 27*n - 72)*x + (27*n^3 + 27*n^2 - 54*n)*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
basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Geometric basis map (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.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
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.