A026729 → θ+1 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 - 2\,x - x^{2} + n + 2\,n x + n x^{2}\right)\,P_{n}(x) = \left(4 + 22\,x + 42\,x^{2} + 34\,x^{3} + 10\,x^{4} - 2\,n - 10\,n x - 19\,n x^{2} - 16\,n x^{3} - 5\,n x^{4}\right)\,P_{n-1}(x) + \left(4\,x + 17\,x^{2} + 27\,x^{3} + 19\,x^{4} + 5\,x^{5}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 0 | 2 | 2 | |||||||||||||
| 3 | 0 | 2 | 5 | 7 | ||||||||||||
| 4 | 0 | 0 | 6 | 10 | 16 | |||||||||||
| 5 | 0 | 0 | 3 | 18 | 20 | 41 | ||||||||||
| 6 | 0 | 0 | 0 | 12 | 44 | 38 | 94 | |||||||||
| 7 | 0 | 0 | 0 | 4 | 42 | 102 | 71 | 219 | ||||||||
| 8 | 0 | 0 | 0 | 0 | 20 | 120 | 222 | 130 | 492 | |||||||
| 9 | 0 | 0 | 0 | 0 | 5 | 80 | 315 | 466 | 235 | 1101 | ||||||
| 10 | 0 | 0 | 0 | 0 | 0 | 30 | 260 | 768 | 948 | 420 | 2426 | |||||
| 11 | 0 | 0 | 0 | 0 | 0 | 6 | 135 | 760 | 1782 | 1884 | 744 | 5311 | ||||
| 12 | 0 | 0 | 0 | 0 | 0 | 0 | 42 | 490 | 2044 | 3972 | 3672 | 1308 | 11528 | |||
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 210 | 1575 | 5180 | 8580 | 7044 | 2285 | 24881 | ||
| 14 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 56 | 840 | 4620 | 12520 | 18060 | 13332 | 3970 | 53398 | |
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 308 | 2940 | 12670 | 29140 | 37206 | 24946 | 6865 | 114083 |
Compute more
?
Technical details
- Node id
n-d0bf5f74983ec343· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-e7a207c59c800cef
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: 0, 2; 3: 0, 2, 5; 4: 0, 0, 6, 10; 5: 0, 0, 3, 18, 20; 6: 0, 0, 0, 12, 44, 38; 7: 0, 0, 0, 4, 42, 102, 71; 8: 0, 0, 0, 0, 20, 120, 222, 130; 9: 0, 0, 0, 0, 5, 80, 315, 466, 235; 10: 0, 0, 0, 0, 0, 30, 260, 768, 948, 420;
%F FormulaThe row polynomials satisfy (n-1+(2*n-2)*x+(n-1)*x^2)*P(n,x) = -(2*n-4+(10*n-22)*x+(19*n-42)*x^2+(16*n-34)*x^3+(5*n-10)*x^4)*P(n-1,x) + (4*x+17*x^2+27*x^3+19*x^4+5*x^5)*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[(-(2*n - 4 + (10*n - 22)*x + (19*n - 42)*x^2 + (16*n - 34)*x^3 + (5*n - 10)*x^4)*P[n - 1, x] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*D[P[n - 1, x], x])/(n - 1 + (2*n - 2)*x + (n - 1)*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] = (-(2*n - 4 + (10*n - 22)*x + (19*n - 42)*x^2 + (16*n - 34)*x^3 + (5*n - 10)*x^4)*v[i - 1] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*deriv(v[i - 1], x))/(n - 1 + (2*n - 2)*x + (n - 1)*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 [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
theta_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidi…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidi…?
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.