A028421 → 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}\right)\,P_{n}(x) = \left(-1 - 2\,x - x^{2} + 2\,n + 6\,n x + 6\,n x^{2} + 2\,n x^{3} - n^{2} - 4\,n^{2} x - 6\,n^{2} x^{2} - 4\,n^{2} x^{3} - n^{2} x^{4}\right)\,P_{n-2}(x) + \left(-1 - x + x^{2} + x^{3} + 2\,n + 6\,n x + 6\,n x^{2} + 2\,n x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 3\,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 | 3 | 4 | |||||||||||||
| 2 | 2 | 10 | 11 | 23 | ||||||||||||
| 3 | 6 | 40 | 80 | 50 | 176 | |||||||||||
| 4 | 24 | 196 | 549 | 646 | 274 | 1689 | ||||||||||
| 5 | 120 | 1148 | 4067 | 6853 | 5572 | 1764 | 19524 | |||||||||
| 6 | 720 | 7848 | 33312 | 72108 | 85007 | 52144 | 13068 | 264207 | ||||||||
| 7 | 5040 | 61416 | 302052 | 792496 | 1211184 | 1085628 | 530840 | 109584 | 4098240 | |||||||
| 8 | 40320 | 541728 | 3017508 | 9255816 | 17266785 | 20183796 | 14497368 | 5867208 | 1026576 | 71697105 | ||||||
| 9 | 362880 | 5319072 | 33006996 | 115491596 | 253294437 | 363110583 | 341537284 | 203802324 | 70150608 | 10628640 | 1396704420 | |||||
| 10 | 3628800 | 57545280 | 392872248 | 1540441904 | 3871510554 | 6549793878 | 7580482051 | 5941377432 | 3023723460 | 903602448 | 120543840 | 29985521895 | ||||
| 11 | 39916800 | 680172480 | 5059054728 | 21931035256 | 62000444090 | 120580096624 | 165148698728 | 159665197822 | 106972290152 | 47365212024 | 12487752576 | 1486442880 | 703416314160 | |||
| 12 | 479001600 | 8720904960 | 70110527616 | 332491914912 | 1042583052068 | 2286925844932 | 3609041054605 | 4137692768938 | 3426009022994 | 2000549890496 | 782795580696 | 184439674368 | 19802759040 | 17901641997225 | ||
| 13 | 6227020800 | 120556788480 | 1040763990528 | 5353838817312 | 18416330806460 | 44908871100936 | 80092546363559 | 105990208878825 | 104238248748792 | 75336627392440 | 38930237002672 | 13631525127504 | 2900739820032 | 283465647360 | 491250187505700 | |
| 14 | 87178291200 | 1787427371520 | 16479801724032 | 91315140748224 | 341537001236272 | 915453999043600 | 1818140789754416 | 2723220996838072 | 3095661034221311 | 2660850154735360 | 1703888211667912 | 788812376641344 | 249723562274352 | 48416646792960 | 4339163001600 | 14459713484342175 |
Compute more
?
Technical details
- Node id
n-9ab5f49ed41429b3· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-032ed337f605ff79
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, 3; 2: 2, 10, 11; 3: 6, 40, 80, 50; 4: 24, 196, 549, 646, 274; 5: 120, 1148, 4067, 6853, 5572, 1764; 6: 720, 7848, 33312, 72108, 85007, 52144, 13068; 7: 5040, 61416, 302052, 792496, 1211184, 1085628, 530840, 109584; 8: 40320, 541728, 3017508, 9255816, 17266785, 20183796, 14497368, 5867208, 1026576; 9: 362880, 5319072, 33006996, 115491596, 253294437, 363110583, 341537284, 203802324, 70150608, 10628640;
%F FormulaThe row polynomials satisfy (1+2*x+x^2)*P(n,x) = -(n^2-2*n+1+(4*n^2-6*n+2)*x+(6*n^2-6*n+1)*x^2+(4*n^2-2*n)*x^3+n^2*x^4)*P(n-2,x) + (2*n-1+(6*n-1)*x+(6*n+1)*x^2+(2*n+1)*x^3)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 2*n + 1 + (4*n^2 - 6*n + 2)*x + (6*n^2 - 6*n + 1)*x^2 + (4*n^2 - 2*n)*x^3 + n^2*x^4)*P[n - 2, x] + (2*n - 1 + (6*n - 1)*x + (6*n + 1)*x^2 + (2*n + 1)*x^3)*P[n - 1, x])/(1 + 2*x + x^2)]];
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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 2*n + 1 + (4*n^2 - 6*n + 2)*x + (6*n^2 - 6*n + 1)*x^2 + (4*n^2 - 2*n)*x^3 + n^2*x^4)*v[i - 2] + (2*n - 1 + (6*n - 1)*x + (6*n + 1)*x^2 + (2*n + 1)*x^3)*v[i - 1])/(1 + 2*x + x^2)); 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 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),…?
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.