A130534 → basis A013610 → x ↦ x+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4 + 3\,x + n\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 | 5 | 3 | 8 | |||||||||||||
| 2 | 30 | 33 | 9 | 72 | ||||||||||||
| 3 | 210 | 321 | 162 | 27 | 720 | |||||||||||
| 4 | 1680 | 3198 | 2259 | 702 | 81 | 7920 | ||||||||||
| 5 | 15120 | 33822 | 29925 | 13095 | 2835 | 243 | 95040 | |||||||||
| 6 | 151200 | 383580 | 400716 | 220725 | 67635 | 10935 | 729 | 1235520 | ||||||||
| 7 | 1663200 | 4672980 | 5558616 | 3630123 | 1406160 | 323190 | 40824 | 2187 | 17297280 | |||||||
| 8 | 19958400 | 61065360 | 80722332 | 60237324 | 27764289 | 8096760 | 1459458 | 148716 | 6561 | 259459200 | ||||||
| 9 | 259459200 | 853724880 | 1232586396 | 1025252208 | 541647729 | 188550747 | 43263234 | 6311682 | 531441 | 19683 | 4151347200 | |||||
| 10 | 3632428800 | 12730525920 | 19817384184 | 18051290100 | 10658824830 | 4264653645 | 1171337517 | 218153250 | 26375220 | 1869885 | 59049 | 70572902400 | ||||
| 11 | 54486432000 | 201855175200 | 335452340520 | 330221504052 | 214036242750 | 95946279165 | 30364023690 | 6786311301 | 1050088050 | 107173935 | 6495390 | 177147 | 1270312243200 | |||
| 12 | 871782912000 | 3393142099200 | 5972802973920 | 6289901086392 | 4415244396156 | 2177249194890 | 773663216535 | 199673051886 | 37160342703 | 4865047110 | 425448045 | 22320522 | 531441 | 24135932620800 | ||
| 13 | 14820309504000 | 60298764422400 | 111717076854240 | 124846727390424 | 93928857993828 | 50258969501598 | 19684022265765 | 5715431531667 | 1230744981609 | 194186828979 | 21827758095 | 1655793009 | 75996063 | 1594323 | 482718652416000 | |
| 14 | 266765571072000 | 1129838688115200 | 2191803676643520 | 2582392323590352 | 2065259626060176 | 1186448025010248 | 505089309288564 | 161929834367301 | 39299704263963 | 7187597866449 | 975460132647 | 95287548447 | 6335308161 | 256686003 | 4782969 | 10137091700736000 |
Compute more
?
Technical details
- Node id
n-219353314d183d27· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-83d96afd81f6fc0a
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: 5, 3; 2: 30, 33, 9; 3: 210, 321, 162, 27; 4: 1680, 3198, 2259, 702, 81; 5: 15120, 33822, 29925, 13095, 2835, 243; 6: 151200, 383580, 400716, 220725, 67635, 10935, 729; 7: 1663200, 4672980, 5558616, 3630123, 1406160, 323190, 40824, 2187; 8: 19958400, 61065360, 80722332, 60237324, 27764289, 8096760, 1459458, 148716, 6561; 9: 259459200, 853724880, 1232586396, 1025252208, 541647729, 188550747, 43263234, 6311682, 531441, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (n+4+3*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[(n + 4 + 3*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] = (n + 4 + 3*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 (−∞, -1]
- 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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+…?
-
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_A013610 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+…?
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.