A059473 → γ → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,n + n^{2} x\right)\,P_{n}(x) = \left(-8\,x - 4\,x^{2} + 4\,n + 8\,n x + 2\,n x^{2} + 2\,n^{2} x + 2\,n^{2} x^{2}\right)\,P_{n-1}(x) + \left(-4\,x - 12\,x^{2} - 8\,x^{3} - 2\,n x^{2} - 4\,n x^{3}\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 | 2 | |||||||
| 2 | 4 | 4 | 8 | ||||||
| 3 | 8 | 16 | 24 | ||||||
| 4 | 16 | 48 | 12 | 76 | |||||
| 5 | 32 | 128 | 72 | 232 | |||||
| 6 | 64 | 320 | 288 | 32 | 704 | ||||
| 7 | 128 | 768 | 960 | 256 | 2112 | ||||
| 8 | 256 | 1792 | 2880 | 1280 | 80 | 6288 | |||
| 9 | 512 | 4096 | 8064 | 5120 | 800 | 18592 | |||
| 10 | 1024 | 9216 | 21504 | 17920 | 4800 | 192 | 54656 | ||
| 11 | 2048 | 20480 | 55296 | 57344 | 22400 | 2304 | 159872 | ||
| 12 | 4096 | 45056 | 138240 | 172032 | 89600 | 16128 | 448 | 465600 | |
| 13 | 8192 | 98304 | 337920 | 491520 | 322560 | 86016 | 6272 | 1350784 | |
| 14 | 16384 | 212992 | 811008 | 1351680 | 1075200 | 387072 | 50176 | 1024 | 3905536 |
Compute more
?
Technical details
- Node id
n-ad7b33c72a99c85c· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-6d1011f498340db8
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: 2; 2: 4, 4; 3: 8, 16; 4: 16, 48, 12; 5: 32, 128, 72; 6: 64, 320, 288, 32; 7: 128, 768, 960, 256; 8: 256, 1792, 2880, 1280, 80; 9: 512, 4096, 8064, 5120, 800;
%F FormulaThe row polynomials satisfy (2*n+n^2*x)*P(n,x) = (4*n+(2*n^2+8*n-8)*x+(2*n^2+2*n-4)*x^2)*P(n-1,x) - (4*x+(2*n+12)*x^2+(4*n+8)*x^3)*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[((4*n + (2*n^2 + 8*n - 8)*x + (2*n^2 + 2*n - 4)*x^2)*P[n - 1, x] - (4*x + (2*n + 12)*x^2 + (4*n + 8)*x^3)*D[P[n - 1, x], x])/(2*n + n^2*x)]];
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] = ((4*n + (2*n^2 + 8*n - 8)*x + (2*n^2 + 2*n - 4)*x^2)*v[i - 1] - (4*x + (2*n + 12)*x^2 + (4*n + 8)*x^3)*deriv(v[i - 1], x))/(2*n + n^2*x)); 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
gamma_polynomial of Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 1…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1, 2+2x).?
-
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 [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
Riordan array (1, 2+2x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1, 2+2x).?
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (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)
- ↑ 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)
- ↑ 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)
- ↑ 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)
-
from
Riordan array (1, 2+2x).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, .…?
-
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
Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, .…?
-
-
from
gamma_polynomial of Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 1…?
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.