A028421 → θ+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 + 3\,x + 3\,x^{2} + x^{3}\right)\,P_{n}(x) = \left(-1 - x + 7\,x^{2} + 17\,x^{3} + 14\,x^{4} + 4\,x^{5} + 2\,n + 6\,n x + 16\,n x^{2} + 40\,n x^{3} + 54\,n x^{4} + 34\,n x^{5} + 8\,n x^{6} - n^{2} - 5\,n^{2} x - 14\,n^{2} x^{2} - 26\,n^{2} x^{3} - 29\,n^{2} x^{4} - 17\,n^{2} x^{5} - 4\,n^{2} x^{6}\right)\,P_{n-2}(x) + \left(-4\,x^{2} - 16\,x^{3} - 24\,x^{4} - 16\,x^{5} - 4\,x^{6} + 4\,n x^{2} + 20\,n x^{3} + 40\,n x^{4} + 40\,n x^{5} + 20\,n x^{6} + 4\,n x^{7}\right)\,P_{n-2}'(x) + \left(-1 + 2\,x^{2} - 4\,x^{3} - 9\,x^{4} - 4\,x^{5} + 2\,n + 8\,n x + 16\,n x^{2} + 20\,n x^{3} + 14\,n x^{4} + 4\,n x^{5}\right)\,P_{n-1}(x) + \left(-4\,x^{2} - 16\,x^{3} - 24\,x^{4} - 16\,x^{5} - 4\,x^{6}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 5\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 5 | 6 | |||||||||||||
| 2 | 2 | 16 | 23 | 41 | ||||||||||||
| 3 | 6 | 62 | 160 | 120 | 348 | |||||||||||
| 4 | 24 | 296 | 1059 | 1486 | 724 | 3589 | ||||||||||
| 5 | 120 | 1696 | 7609 | 15211 | 14154 | 5012 | 43802 | |||||||||
| 6 | 720 | 11376 | 60696 | 155184 | 208711 | 142850 | 39332 | 618869 | ||||||||
| 7 | 5040 | 87552 | 537660 | 1659724 | 2885936 | 2880216 | 1544624 | 345832 | 9946584 | |||||||
| 8 | 40320 | 760896 | 5260428 | 18918216 | 40054845 | 52035636 | 40930188 | 17942928 | 3371976 | 179315433 | ||||||
| 9 | 362880 | 7372224 | 56468412 | 230917412 | 573522609 | 912191313 | 938318656 | 605806740 | 223750824 | 36135792 | 3584846862 | |||||
| 10 | 3628800 | 78802560 | 660709224 | 3018789632 | 8574459442 | 16069699944 | 20314404967 | 17209091252 | 9389378844 | 2988577560 | 422379792 | 78729922017 | ||||
| 11 | 39916800 | 921260160 | 8375439384 | 42192648472 | 134553938402 | 289477471114 | 432560311352 | 451578088936 | 324089820080 | 152735249784 | 42634854288 | 5349561984 | 1884508560756 | |||
| 12 | 479001600 | 11693790720 | 114401628288 | 628862383488 | 2220488026132 | 5380890653048 | 9254806467711 | 11447295823874 | 10145617362256 | 6301462812984 | 2609101716168 | 647684931024 | 72996193152 | 48835780790445 | ||
| 13 | 6227020800 | 160162306560 | 1675610509824 | 9966951373440 | 38543265859180 | 103706249347476 | 201376855737425 | 287273846485687 | 302202985466178 | 232175030180440 | 126886097459632 | 46787590522032 | 10446567405408 | 1067779243008 | 1362275218917090 | |
| 14 | 87178291200 | 2354358666240 | 26202849342336 | 167502942304512 | 703218457950896 | 2077353981898880 | 4487899536888512 | 7240641656669248 | 8798402330125295 | 8034535342025734 | 5438519554670232 | 2650195673024480 | 879969179642544 | 178385930552736 | 16670798231040 | 40701939770283885 |
Compute more
?
Technical details
- Node id
n-d0dded0d1e8e9e68· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-841a32018555c02e
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: 1, 5; 2: 2, 16, 23; 3: 6, 62, 160, 120; 4: 24, 296, 1059, 1486, 724; 5: 120, 1696, 7609, 15211, 14154, 5012; 6: 720, 11376, 60696, 155184, 208711, 142850, 39332; 7: 5040, 87552, 537660, 1659724, 2885936, 2880216, 1544624, 345832; 8: 40320, 760896, 5260428, 18918216, 40054845, 52035636, 40930188, 17942928, 3371976; 9: 362880, 7372224, 56468412, 230917412, 573522609, 912191313, 938318656, 605806740, 223750824, 36135792;
%F FormulaThe row polynomials satisfy (1+3*x+3*x^2+x^3)*P(n,x) = -(n^2-2*n+1+(5*n^2-6*n+1)*x+(14*n^2-16*n-7)*x^2+(26*n^2-40*n-17)*x^3+(29*n^2-54*n-14)*x^4+(17*n^2-34*n-4)*x^5+(4*n^2-8*n)*x^6)*P(n-2,x) + ((4*n-4)*x^2+(20*n-16)*x^3+(40*n-24)*x^4+(40*n-16)*x^5+(20*n-4)*x^6+4*n*x^7)*d/dx P(n-2,x) + (2*n-1+8*n*x+(16*n+2)*x^2+(20*n-4)*x^3+(14*n-9)*x^4+(4*n-4)*x^5)*P(n-1,x) - (4*x^2+16*x^3+24*x^4+16*x^5+4*x^6)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 5*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 5*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 2*n + 1 + (5*n^2 - 6*n + 1)*x + (14*n^2 - 16*n - 7)*x^2 + (26*n^2 - 40*n - 17)*x^3 + (29*n^2 - 54*n - 14)*x^4 + (17*n^2 - 34*n - 4)*x^5 + (4*n^2 - 8*n)*x^6)*P[n - 2, x] + ((4*n - 4)*x^2 + (20*n - 16)*x^3 + (40*n - 24)*x^4 + (40*n - 16)*x^5 + (20*n - 4)*x^6 + 4*n*x^7)*D[P[n - 2, x], x] + (2*n - 1 + 8*n*x + (16*n + 2)*x^2 + (20*n - 4)*x^3 + (14*n - 9)*x^4 + (4*n - 4)*x^5)*P[n - 1, x] - (4*x^2 + 16*x^3 + 24*x^4 + 16*x^5 + 4*x^6)*D[P[n - 1, x], x])/(1 + 3*x + 3*x^2 + x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 5*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 2*n + 1 + (5*n^2 - 6*n + 1)*x + (14*n^2 - 16*n - 7)*x^2 + (26*n^2 - 40*n - 17)*x^3 + (29*n^2 - 54*n - 14)*x^4 + (17*n^2 - 34*n - 4)*x^5 + (4*n^2 - 8*n)*x^6)*v[i - 2] + ((4*n - 4)*x^2 + (20*n - 16)*x^3 + (40*n - 24)*x^4 + (40*n - 16)*x^5 + (20*n - 4)*x^6 + 4*n*x^7)*deriv(v[i - 2], x) + (2*n - 1 + 8*n*x + (16*n + 2)*x^2 + (20*n - 4)*x^3 + (14*n - 9)*x^4 + (4*n - 4)*x^5)*v[i - 1] - (4*x^2 + 16*x^3 + 24*x^4 + 16*x^5 + 4*x^6)*deriv(v[i - 1], x))/(1 + 3*x + 3*x^2 + x^3)); 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
theta_plus_one_squared of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2).…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n),…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
-
from
theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n),…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
-
from
theta_plus_one_squared of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2).…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.