A137320 → basis A013609 → reverse
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(4 + x + n x\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 | 4 | 2 | 6 | |||||||||||||
| 2 | 16 | 20 | 6 | 42 | ||||||||||||
| 3 | 64 | 144 | 104 | 24 | 336 | |||||||||||
| 4 | 256 | 896 | 1136 | 616 | 120 | 3024 | ||||||||||
| 5 | 1024 | 5120 | 9920 | 9280 | 4176 | 720 | 30240 | |||||||||
| 6 | 4096 | 27648 | 75520 | 106560 | 81664 | 32112 | 5040 | 332640 | ||||||||
| 7 | 16384 | 143360 | 523264 | 1030400 | 1179136 | 781760 | 277056 | 40320 | 3991680 | |||||||
| 8 | 65536 | 720896 | 3383296 | 8830976 | 13990144 | 13739264 | 8144064 | 2654784 | 362880 | 51891840 | ||||||
| 9 | 262144 | 3538944 | 20742144 | 69156864 | 144270336 | 194858496 | 169968896 | 92059776 | 27999360 | 3628800 | 726485760 | |||||
| 10 | 1048576 | 17039360 | 121896960 | 504791040 | 1337806848 | 2366407680 | 2823319040 | 2237896960 | 1124654976 | 322508160 | 39916800 | 10897286400 | ||||
| 11 | 4194304 | 80740352 | 692060160 | 3481927680 | 11408719872 | 25519312896 | 39690168320 | 42831416320 | 31353383424 | 14785892352 | 4029765120 | 479001600 | 174356582400 | |||
| 12 | 16777216 | 377487360 | 3817865216 | 22924492800 | 90899939328 | 250390609920 | 490511740928 | 687297853440 | 682221945856 | 466737553920 | 208335661056 | 54302952960 | 6227020800 | 2964061900800 | ||
| 13 | 67108864 | 1744830464 | 20556283904 | 145148084224 | 684542656512 | 2274161590272 | 5467515502592 | 9616355786752 | 12351057731584 | 11418057457664 | 7367668399104 | 3133911066624 | 785149424640 | 87178291200 | 53353114214400 | |
| 14 | 268435456 | 7985954816 | 108397592576 | 888936595456 | 4915391889408 | 19364786208768 | 55982485864448 | 120478155685888 | 193649567727616 | 230938095804416 | 200741535461376 | 123050670253056 | 50149263697920 | 12125954534400 | 1307674368000 | 1013709170073600 |
Compute more
?
Technical details
- Node id
n-5f097fd6f4e6ec91· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-02dd92f09da9263e
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: 4, 2; 2: 16, 20, 6; 3: 64, 144, 104, 24; 4: 256, 896, 1136, 616, 120; 5: 1024, 5120, 9920, 9280, 4176, 720; 6: 4096, 27648, 75520, 106560, 81664, 32112, 5040; 7: 16384, 143360, 523264, 1030400, 1179136, 781760, 277056, 40320; 8: 65536, 720896, 3383296, 8830976, 13990144, 13739264, 8144064, 2654784, 362880; 9: 262144, 3538944, 20742144, 69156864, 144270336, 194858496, 169968896, 92059776, 27999360, 3628800;
%F FormulaThe row polynomials satisfy P(n,x) = (4+(n+1)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4 + (n + 1)*x)*P[n - 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] = (4 + (n + 1)*x)*v[i - 1]); 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 (−∞, 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…?
Related ?
Same fingerprint ?
- A028338 → basis A013609 → basis A013611
- A286718 → basis A013611 → basis A013610
- A137320 → basis A013609
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.