A026729 → basis A008277 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-x^{2}\right)\,P_{n-4}(x) + \left(-x^{2}\right)\,P_{n-4}'(x) + \left(-2\,x^{2}\right)\,P_{n-3}(x) + \left(-2\,x^{2}\right)\,P_{n-3}'(x) + \left(1 + 2\,x - x^{2}\right)\,P_{n-2}(x) + \left(x - x^{2}\right)\,P_{n-2}'(x) + \left(1 + 2\,x\right)\,P_{n-1}(x) + \left(x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 2\,x\)
\(P_{3}(x) = 2 + 8\,x + 3\,x^{2}\)
\(P_{4}(x) = 3 + 26\,x + 24\,x^{2} + 4\,x^{3}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 1 | 2 | 3 | |||||||||||||
| 3 | 2 | 8 | 3 | 13 | ||||||||||||
| 4 | 3 | 26 | 24 | 4 | 57 | |||||||||||
| 5 | 5 | 78 | 132 | 52 | 5 | 272 | ||||||||||
| 6 | 8 | 224 | 624 | 432 | 95 | 6 | 1389 | |||||||||
| 7 | 13 | 630 | 2721 | 2944 | 1105 | 156 | 7 | 7576 | ||||||||
| 8 | 21 | 1750 | 11316 | 17964 | 10220 | 2412 | 238 | 8 | 43929 | |||||||
| 9 | 34 | 4828 | 45681 | 102348 | 82760 | 28998 | 4711 | 344 | 9 | 269713 | ||||||
| 10 | 55 | 13266 | 180858 | 557244 | 615290 | 300036 | 71288 | 8472 | 477 | 10 | 1746996 | |||||
| 11 | 89 | 36366 | 706758 | 2940420 | 4314740 | 2811864 | 915866 | 157384 | 14292 | 640 | 11 | 11898430 | ||||
| 12 | 144 | 99552 | 2737296 | 15174144 | 29022230 | 24587436 | 10540628 | 2455024 | 319509 | 22910 | 836 | 12 | 84959721 | |||
| 13 | 233 | 272302 | 10536039 | 77050328 | 189328055 | 204400164 | 112161308 | 33992400 | 5943168 | 606390 | 35222 | 1068 | 13 | 634326690 | ||
| 14 | 377 | 744462 | 40377786 | 386595668 | 1207032015 | 1635945942 | 1126065752 | 431810176 | 97367445 | 13251530 | 1088868 | 52296 | 1339 | 14 | 4940333670 | |
| 15 | 610 | 2034748 | 154266621 | 1922469084 | 7561357845 | 12717708720 | 10814659877 | 5141537248 | 1453823415 | 253368770 | 27608702 | 1866648 | 75387 | 1652 | 15 | 40050779342 |
Compute more
?
Technical details
- Node id
n-9a641acc1d377232· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-9c3ef9fd36e933df
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, 2; 3: 2, 8, 3; 4: 3, 26, 24, 4; 5: 5, 78, 132, 52, 5; 6: 8, 224, 624, 432, 95, 6; 7: 13, 630, 2721, 2944, 1105, 156, 7; 8: 21, 1750, 11316, 17964, 10220, 2412, 238, 8; 9: 34, 4828, 45681, 102348, 82760, 28998, 4711, 344, 9; 10: 55, 13266, 180858, 557244, 615290, 300036, 71288, 8472, 477, 10;
%F FormulaThe row polynomials satisfy P(n,x) = -x^2*P(n-4,x) - x^2*d/dx P(n-4,x) - 2*x^2*P(n-3,x) - 2*x^2*d/dx P(n-3,x) + (1+2*x-x^2)*P(n-2,x) + (x-x^2)*d/dx P(n-2,x) + (1+2*x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 1 + 2*x, P(3,x) = 2 + 8*x + 3*x^2, P(4,x) = 3 + 26*x + 24*x^2 + 4*x^3.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 1 + 2*x;
P[3, x_] := 2 + 8*x + 3*x^2;
P[4, x_] := 3 + 26*x + 24*x^2 + 4*x^3;
P[n_, x_] := P[n, x] = Expand[-x^2*P[n - 4, x] - x^2*D[P[n - 4, x], x] - 2*x^2*P[n - 3, x] - 2*x^2*D[P[n - 3, x], x] + (1 + 2*x - x^2)*P[n - 2, x] + (x - x^2)*D[P[n - 2, x], x] + (1 + 2*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; v[3] = 2 + 8*x + 3*x^2; v[4] = 3 + 26*x + 24*x^2 + 4*x^3; for(n = 5, N, my(i = n); v[i] = -x^2*v[i - 4] - x^2*deriv(v[i - 4], x) - 2*x^2*v[i - 3] - 2*x^2*deriv(v[i - 3], x) + (1 + 2*x - x^2)*v[i - 2] + (x - x^2)*deriv(v[i - 2], x) + (1 + 2*x)*v[i - 1] + x*deriv(v[i - 1], x)); 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_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
-
from
basis_map_A008277 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.