A143494 → x ↦ x+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 + x\right)\,P_{n}(x) = \left(5 + 15\,x + 14\,x^{2} + 4\,x^{3} - n - 4\,n x - 5\,n x^{2} - 2\,n x^{3}\right)\,P_{n-1}(x) + \left(1 + 5\,x + 9\,x^{2} + 7\,x^{3} + 2\,x^{4}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 3 | 4 | 7 | ||||||
| 3 | 10 | 27 | 18 | 55 | |||||
| 4 | 37 | 151 | 203 | 90 | 481 | ||||
| 5 | 151 | 825 | 1672 | 1491 | 494 | 4633 | |||
| 6 | 674 | 4611 | 12494 | 16771 | 11159 | 2946 | 48655 | ||
| 7 | 3263 | 26796 | 90871 | 162964 | 163076 | 86375 | 18926 | 552271 | |
| 8 | 17007 | 162856 | 662927 | 1487536 | 1987859 | 1582603 | 695267 | 130066 | 6726121 |
Compute more
?
Technical details
- Node id
n-9a2524769e8d44e8· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-0e87d476abd07608
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: 3, 4; 3: 10, 27, 18; 4: 37, 151, 203, 90; 5: 151, 825, 1672, 1491, 494; 6: 674, 4611, 12494, 16771, 11159, 2946; 7: 3263, 26796, 90871, 162964, 163076, 86375, 18926; 8: 17007, 162856, 662927, 1487536, 1987859, 1582603, 695267, 130066; 9: 94828, 1036735, 4921946, 13256963, 22162981, 23556539, 15549472, 5829643, 950654; 10: 562595, 6910597, 37468454, 117716915, 236227319, 314075287, 276726316, 155842507, 50914415, 7353794;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = -(n-5+(4*n-15)*x+(5*n-14)*x^2+(2*n-4)*x^3)*P(n-1,x) + (1+5*x+9*x^2+7*x^3+2*x^4)*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[(-(n - 5 + (4*n - 15)*x + (5*n - 14)*x^2 + (2*n - 4)*x^3)*P[n - 1, x] + (1 + 5*x + 9*x^2 + 7*x^3 + 2*x^4)*D[P[n - 1, x], x])/(1 + x)]];
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] = (-(n - 5 + (4*n - 15)*x + (5*n - 14)*x^2 + (2*n - 4)*x^3)*v[i - 1] + (1 + 5*x + 9*x^2 + 7*x^3 + 2*x^4)*deriv(v[i - 1], x))/(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 [-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
shift_x_plus_one of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Ray basis map theorem (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
shift_x_plus_one of Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
-
from
shift_x_plus_one of Triangle read by rows: 2-Stirling numbers of the second kind.?
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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.