A137320 → basis A013609 → x ↦ x/(x+1)
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + x\right)\,P_{n}(x) = \left(1 + 6\,x + 5\,x^{2} + n + 2\,n x + n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 6 | 8 | |||||||||||||
| 2 | 6 | 32 | 42 | 80 | ||||||||||||
| 3 | 24 | 176 | 424 | 336 | 960 | |||||||||||
| 4 | 120 | 1096 | 3704 | 5496 | 3024 | 13440 | ||||||||||
| 5 | 720 | 7776 | 33184 | 70016 | 73104 | 30240 | 215040 | |||||||||
| 6 | 5040 | 62352 | 317824 | 855136 | 1281904 | 1015824 | 332640 | 3870720 | ||||||||
| 7 | 40320 | 559296 | 3290816 | 10654976 | 20516864 | 23509440 | 14851008 | 3991680 | 77414400 | |||||||
| 8 | 362880 | 5557824 | 36888192 | 138675392 | 323166464 | 478304192 | 439281792 | 228988224 | 51891840 | 1703116800 | ||||||
| 9 | 3628800 | 60658560 | 446691456 | 1903188608 | 5173120128 | 9307372416 | 11089076608 | 8439827328 | 3724753536 | 726485760 | 40874803200 | |||||
| 10 | 39916800 | 721676160 | 5823484416 | 27635446528 | 85452150528 | 179977898496 | 261590428928 | 259174249728 | 167569698816 | 63862646400 | 10897286400 | 1062744883200 | ||||
| 11 | 479001600 | 9298782720 | 81428631552 | 424801108992 | 1467592950784 | 3526969190400 | 6018731523072 | 7295537859584 | 6157624381440 | 3447466937856 | 1152569779200 | 174356582400 | 29756856729600 | |||
| 12 | 6227020800 | 129027202560 | 1216651516416 | 6906701153280 | 26300327213056 | 70799679638528 | 138201986036736 | 197160428066816 | 204073260571648 | 149496684676608 | 73590345073152 | 21860321817600 | 2964061900800 | 892705701888000 | ||
| 13 | 87178291200 | 1918467210240 | 19355610875904 | 118593543441408 | 492525201741824 | 1464601404774400 | 3209222038007808 | 5247881741596672 | 6405913353205760 | 5766272275762176 | 3721205155203072 | 1630670716763136 | 434982659328000 | 53353114214400 | 28566582460416000 | |
| 14 | 1307674368000 | 30433395686400 | 326785040133120 | 2146659758263296 | 9641155351514112 | 31326999904710656 | 75965757260830720 | 139693444846098432 | 195798453388423168 | 208206437847342080 | 165377250567527424 | 95162958700305408 | 37507483508419584 | 9064967240448000 | 1013709170073600 | 971263803654144000 |
Compute more
?
Technical details
- Node id
n-4fda2e5d70c9292d· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-1a2f142e31a877af
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 6; 2: 6, 32, 42; 3: 24, 176, 424, 336; 4: 120, 1096, 3704, 5496, 3024; 5: 720, 7776, 33184, 70016, 73104, 30240; 6: 5040, 62352, 317824, 855136, 1281904, 1015824, 332640; 7: 40320, 559296, 3290816, 10654976, 20516864, 23509440, 14851008, 3991680; 8: 362880, 5557824, 36888192, 138675392, 323166464, 478304192, 439281792, 228988224, 51891840; 9: 3628800, 60658560, 446691456, 1903188608, 5173120128, 9307372416, 11089076608, 8439827328, 3724753536, 726485760;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = (n+1+(2*n+6)*x+(n+5)*x^2)*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[((n + 1 + (2*n + 6)*x + (n + 5)*x^2)*P[n - 1, 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] = ((n + 1 + (2*n + 6)*x + (n + 5)*x^2)*v[i - 1])/(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_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1…?
-
Geometric basis map (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…?
-
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…?
-
Geometric basis map (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) (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
basis_map_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.