A156992 → basis A008277 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(3 + x + 3\,n + n x\right)\,P_{n-1}(x) + \left(1 + x + n + 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 | 6 | 2 | 8 | |||||||||||||
| 2 | 60 | 42 | 6 | 108 | ||||||||||||
| 3 | 888 | 960 | 288 | 24 | 2160 | |||||||||||
| 4 | 18120 | 26520 | 12360 | 2160 | 120 | 59280 | ||||||||||
| 5 | 485280 | 893520 | 568800 | 154800 | 18000 | 720 | 2121120 | |||||||||
| 6 | 16445520 | 36378720 | 29413440 | 10987200 | 1990800 | 166320 | 5040 | 95387040 | ||||||||
| 7 | 685722240 | 1766298240 | 1731260160 | 826398720 | 206035200 | 26812800 | 1693440 | 40320 | 5244261120 | |||||||
| 8 | 34411184640 | 100920919680 | 116116156800 | 67624139520 | 21624382080 | 3876284160 | 381024000 | 18869760 | 362880 | 344973323520 | ||||||
| 9 | 2041544736000 | 6703271769600 | 8843741222400 | 6083585222400 | 2383762348800 | 549207993600 | 74375884800 | 5726246400 | 228614400 | 3628800 | 26685447667200 | |||||
| 10 | 141106965753600 | 511963256851200 | 760900069036800 | 603683321472000 | 280675577952000 | 79460497670400 | 13845421497600 | 1468139904000 | 91010304000 | 2993760000 | 39916800 | 2393197294118400 | ||||
| 11 | 11223409849344000 | 44529121574784000 | 73530162797414400 | 66068427716121600 | 35588578265856000 | 11993185059609600 | 2572155245721600 | 351058835635200 | 29954365056000 | 1528015104000 | 42152140800 | 479001600 | 245887624355788800 | |||
| 12 | 1016591564596608000 | 4373202882663014400 | 7935007843232870400 | 7959835548048384000 | 4877007211377100800 | 1910570872821811200 | 488799923567155200 | 82190920792780800 | 9026016833433600 | 633256880256000 | 27056405376000 | 635156121600 | 6227020800 | 28652893738601932800 | ||
| 13 | 103921686070339737600 | 481311862944001689600 | 950988482401615257600 | 1052828699678442086400 | 723124365485160038400 | 323321232294963302400 | 96391492826659430400 | 19360841726274048000 | 2620469850359961600 | 236539288303718400 | 13887676144742400 | 504326414592000 | 10199860070400 | 87178291200 | 3754120074855716966400 | |
| 14 | 11896153817325313536000 | 58967191539743655168000 | 125921105609811063552000 | 152406872136193618944000 | 115969581293240683008000 | 58320647712072345600000 | 19895558397282247680000 | 4664455033384194048000 | 754722955124506368000 | 83967271071780096000 | 6339400031188224000 | 316059664048128000 | 9876864501504000 | 173920690944000 | 1307674368000 | 548886921277037511168000 |
Compute more
?
Technical details
- Node id
n-496eebcad55bac71· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-f80b58a897df2b0a
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: 6, 2; 2: 60, 42, 6; 3: 888, 960, 288, 24; 4: 18120, 26520, 12360, 2160, 120; 5: 485280, 893520, 568800, 154800, 18000, 720; 6: 16445520, 36378720, 29413440, 10987200, 1990800, 166320, 5040; 7: 685722240, 1766298240, 1731260160, 826398720, 206035200, 26812800, 1693440, 40320; 8: 34411184640, 100920919680, 116116156800, 67624139520, 21624382080, 3876284160, 381024000, 18869760, 362880; 9: 2041544736000, 6703271769600, 8843741222400, 6083585222400, 2383762348800, 549207993600, 74375884800, 5726246400, 228614400, 3628800;
%F FormulaThe row polynomials satisfy P(n,x) = (3*n+3+(n+1)*x)*P(n-1,x) + (n+1+(n+1)*x)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3*n + 3 + (n + 1)*x)*P[n - 1, x] + (n + 1 + (n + 1)*x)*D[P[n - 1, x], 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] = (3*n + 3 + (n + 1)*x)*v[i - 1] + (n + 1 + (n + 1)*x)*deriv(v[i - 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]
- 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
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A008277 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (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)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A008277 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- A143494 → x ↦ x+1
- A126351 → x ↦ x/(x+1)
- A143494 → reverse → x ↦ x/(x+1)
- A137597 → D+1
- A143494 → x ↦ x+1 → reverse
- A137597 → D+1 → reverse
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.