A156992 → basis A008277 → 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(2 + 6\,x + 5\,x^{2} + x^{3} + 2\,n + 5\,n x + 3\,n x^{2} - n^{2} x - 2\,n^{2} x^{2} - n^{2} x^{3}\right)\,P_{n-1}(x) + \left(x + 3\,x^{2} + 3\,x^{3} + x^{4} + n x + 3\,n x^{2} + 3\,n x^{3} + n 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 | 4 | 6 | 10 | ||||||
| 2 | 24 | 78 | 60 | 162 | |||||
| 3 | 192 | 1032 | 1704 | 888 | 3816 | ||||
| 4 | 1920 | 15480 | 41520 | 45960 | 18120 | 123000 | |||
| 5 | 23040 | 267120 | 1043280 | 1847520 | 1532880 | 485280 | 5199120 | ||
| 6 | 322560 | 5286960 | 28405440 | 71789760 | 94202640 | 62294400 | 16445520 | 278747280 | |
| 7 | 5160960 | 119145600 | 851195520 | 2887355520 | 5335706880 | 5533637760 | 3033757440 | 685722240 | 18451681920 |
Compute more
?
Technical details
- Node id
n-41d756b3ad7bb8d8· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-91f3a2ca42629500
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 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: 4, 6; 2: 24, 78, 60; 3: 192, 1032, 1704, 888; 4: 1920, 15480, 41520, 45960, 18120; 5: 23040, 267120, 1043280, 1847520, 1532880, 485280; 6: 322560, 5286960, 28405440, 71789760, 94202640, 62294400, 16445520; 7: 5160960, 119145600, 851195520, 2887355520, 5335706880, 5533637760, 3033757440, 685722240; 8: 92897280, 3031136640, 28173277440, 123497136000, 301796772480, 436759827840, 373182888960, 174368557440, 34411184640; 9: 1857945600, 86289235200, 1028565216000, 5680944460800, 17652381062400, 33452234323200, 39620751609600, 28713177561600, 11670630854400, 2041544736000;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = (2*n+2-(n^2-5*n-6)*x-(2*n^2-3*n-5)*x^2-(n^2-1)*x^3)*P(n-1,x) + ((n+1)*x+(3*n+3)*x^2+(3*n+3)*x^3+(n+1)*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[((2*n + 2 - (n^2 - 5*n - 6)*x - (2*n^2 - 3*n - 5)*x^2 - (n^2 - 1)*x^3)*P[n - 1, x] + ((n + 1)*x + (3*n + 3)*x^2 + (3*n + 3)*x^3 + (n + 1)*x^4)*D[P[n - 1, x], x])/(1 + 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] = ((2*n + 2 - (n^2 - 5*n - 6)*x - (2*n^2 - 3*n - 5)*x^2 - (n^2 - 1)*x^3)*v[i - 1] + ((n + 1)*x + (3*n + 3)*x^2 + (3*n + 3)*x^3 + (n + 1)*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 - 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 [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A008277 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A008277 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- A126351 → x ↦ x+1
- A126351 → reverse → x ↦ x/(x+1)
- A143494 → reverse → x ↦ x+1
- A126351 → x ↦ x+1 → reverse
- A143494 → x ↦ x/(x+1)
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.