A169803 → basis A013611 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(40 + 192\,x + 128\,x^{2} + 40\,n + 272\,n x + 320\,n x^{2} + 80\,n^{2} x + 256\,n^{2} x^{2} + 64\,n^{3} x^{2}\right)\,P_{n}(x) = \left(40 + 192\,x + 128\,x^{2} + 120\,n + 1216\,n x + 3648\,n x^{2} + 3072\,n x^{3} + 320\,n^{2} x + 1920\,n^{2} x^{2} + 2560\,n^{2} x^{3} + 192\,n^{3} x^{2} + 512\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-25 - 420\,x - 2528\,x^{2} - 6528\,x^{3} - 6144\,x^{4} - 100\,n x - 1120\,n x^{2} - 4160\,n x^{3} - 5120\,n x^{4} - 80\,n^{2} x^{2} - 576\,n^{2} x^{3} - 1024\,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 | 2 | 8 | 10 | ||||||
| 2 | 3 | 16 | 19 | ||||||
| 3 | 5 | 40 | 48 | 93 | |||||
| 4 | 8 | 80 | 144 | 232 | |||||
| 5 | 13 | 160 | 432 | 256 | 861 | ||||
| 6 | 21 | 304 | 1056 | 1024 | 2405 | ||||
| 7 | 34 | 568 | 2448 | 3584 | 1280 | 7914 | |||
| 8 | 55 | 1040 | 5328 | 10240 | 6400 | 23063 | |||
| 9 | 89 | 1880 | 11184 | 26880 | 25600 | 6144 | 71777 | ||
| 10 | 144 | 3360 | 22752 | 65536 | 83200 | 36864 | 211856 | ||
| 11 | 233 | 5952 | 45216 | 152064 | 243200 | 165888 | 28672 | 641225 | |
| 12 | 377 | 10464 | 88128 | 338944 | 654080 | 602112 | 200704 | 1894809 | |
| 13 | 610 | 18280 | 169056 | 732160 | 1657600 | 1935360 | 1003520 | 131072 | 5647658 |
| 14 | 987 | 31760 | 319968 | 1541120 | 4006400 | 5677056 | 4014080 | 1048576 | 16639947 |
Compute more
?
Technical details
- Node id
n-cded572742f81719· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-83336882d0e5b15c
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (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: 1; 1: 2, 8; 2: 3, 16; 3: 5, 40, 48; 4: 8, 80, 144; 5: 13, 160, 432, 256; 6: 21, 304, 1056, 1024; 7: 34, 568, 2448, 3584, 1280; 8: 55, 1040, 5328, 10240, 6400; 9: 89, 1880, 11184, 26880, 25600, 6144;
%F FormulaThe row polynomials satisfy (40*n+40+(80*n^2+272*n+192)*x+(64*n^3+256*n^2+320*n+128)*x^2)*P(n,x) = (120*n+40+(320*n^2+1216*n+192)*x+(192*n^3+1920*n^2+3648*n+128)*x^2+(512*n^3+2560*n^2+3072*n)*x^3)*P(n-1,x) - (25+(100*n+420)*x+(80*n^2+1120*n+2528)*x^2+(576*n^2+4160*n+6528)*x^3+(1024*n^2+5120*n+6144)*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[((120*n + 40 + (320*n^2 + 1216*n + 192)*x + (192*n^3 + 1920*n^2 + 3648*n + 128)*x^2 + (512*n^3 + 2560*n^2 + 3072*n)*x^3)*P[n - 1, x] - (25 + (100*n + 420)*x + (80*n^2 + 1120*n + 2528)*x^2 + (576*n^2 + 4160*n + 6528)*x^3 + (1024*n^2 + 5120*n + 6144)*x^4)*D[P[n - 1, x], x])/(40*n + 40 + (80*n^2 + 272*n + 192)*x + (64*n^3 + 256*n^2 + 320*n + 128)*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] = ((120*n + 40 + (320*n^2 + 1216*n + 192)*x + (192*n^3 + 1920*n^2 + 3648*n + 128)*x^2 + (512*n^3 + 2560*n^2 + 3072*n)*x^3)*v[i - 1] - (25 + (100*n + 420)*x + (80*n^2 + 1120*n + 2528)*x^2 + (576*n^2 + 4160*n + 6528)*x^3 + (1024*n^2 + 5120*n + 6144)*x^4)*deriv(v[i - 1], x))/(40*n + 40 + (80*n^2 + 272*n + 192)*x + (64*n^3 + 256*n^2 + 320*n + 128)*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_A013611 of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Geometric basis map (elementary) 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).?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 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.