A169803 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(20 + 48\,x + 16\,x^{2} + 20\,n + 68\,n x + 40\,n x^{2} + 20\,n^{2} x + 32\,n^{2} x^{2} + 8\,n^{3} x^{2}\right)\,P_{n}(x) = \left(20 + 48\,x + 16\,x^{2} + 60\,n + 304\,n x + 456\,n x^{2} + 192\,n x^{3} + 80\,n^{2} x + 240\,n^{2} x^{2} + 160\,n^{2} x^{3} + 24\,n^{3} x^{2} + 32\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-25 - 210\,x - 632\,x^{2} - 816\,x^{3} - 384\,x^{4} - 50\,n x - 280\,n x^{2} - 520\,n x^{3} - 320\,n x^{4} - 20\,n^{2} x^{2} - 72\,n^{2} x^{3} - 64\,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 | 4 | 6 | ||||||
| 2 | 3 | 8 | 11 | ||||||
| 3 | 5 | 20 | 12 | 37 | |||||
| 4 | 8 | 40 | 36 | 84 | |||||
| 5 | 13 | 80 | 108 | 32 | 233 | ||||
| 6 | 21 | 152 | 264 | 128 | 565 | ||||
| 7 | 34 | 284 | 612 | 448 | 80 | 1458 | |||
| 8 | 55 | 520 | 1332 | 1280 | 400 | 3587 | |||
| 9 | 89 | 940 | 2796 | 3360 | 1600 | 192 | 8977 | ||
| 10 | 144 | 1680 | 5688 | 8192 | 5200 | 1152 | 22056 | ||
| 11 | 233 | 2976 | 11304 | 19008 | 15200 | 5184 | 448 | 54353 | |
| 12 | 377 | 5232 | 22032 | 42368 | 40880 | 18816 | 3136 | 132841 | |
| 13 | 610 | 9140 | 42264 | 91520 | 103600 | 60480 | 15680 | 1024 | 324318 |
| 14 | 987 | 15880 | 79992 | 192640 | 250400 | 177408 | 62720 | 8192 | 788219 |
Compute more
?
Technical details
- Node id
n-bbc27d1386324773· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-ce70a67c11277875
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, 4; 2: 3, 8; 3: 5, 20, 12; 4: 8, 40, 36; 5: 13, 80, 108, 32; 6: 21, 152, 264, 128; 7: 34, 284, 612, 448, 80; 8: 55, 520, 1332, 1280, 400; 9: 89, 940, 2796, 3360, 1600, 192;
%F FormulaThe row polynomials satisfy (20*n+20+(20*n^2+68*n+48)*x+(8*n^3+32*n^2+40*n+16)*x^2)*P(n,x) = (60*n+20+(80*n^2+304*n+48)*x+(24*n^3+240*n^2+456*n+16)*x^2+(32*n^3+160*n^2+192*n)*x^3)*P(n-1,x) - (25+(50*n+210)*x+(20*n^2+280*n+632)*x^2+(72*n^2+520*n+816)*x^3+(64*n^2+320*n+384)*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[((60*n + 20 + (80*n^2 + 304*n + 48)*x + (24*n^3 + 240*n^2 + 456*n + 16)*x^2 + (32*n^3 + 160*n^2 + 192*n)*x^3)*P[n - 1, x] - (25 + (50*n + 210)*x + (20*n^2 + 280*n + 632)*x^2 + (72*n^2 + 520*n + 816)*x^3 + (64*n^2 + 320*n + 384)*x^4)*D[P[n - 1, x], x])/(20*n + 20 + (20*n^2 + 68*n + 48)*x + (8*n^3 + 32*n^2 + 40*n + 16)*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] = ((60*n + 20 + (80*n^2 + 304*n + 48)*x + (24*n^3 + 240*n^2 + 456*n + 16)*x^2 + (32*n^3 + 160*n^2 + 192*n)*x^3)*v[i - 1] - (25 + (50*n + 210)*x + (20*n^2 + 280*n + 632)*x^2 + (72*n^2 + 520*n + 816)*x^3 + (64*n^2 + 320*n + 384)*x^4)*deriv(v[i - 1], x))/(20*n + 20 + (20*n^2 + 68*n + 48)*x + (8*n^3 + 32*n^2 + 40*n + 16)*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 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_A013609 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.