A156992 → basis A013610 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2 + 3\,n x\right)\,P_{n}(x) = \left(4 + 12\,x + 9\,x^{2} + 4\,n + 18\,n x + 18\,n x^{2} + 6\,n^{2} x + 9\,n^{2} 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 | 4 | 12 | 16 | |||||||||||||
| 2 | 24 | 144 | 162 | 330 | ||||||||||||
| 3 | 192 | 1728 | 3888 | 2592 | 8400 | |||||||||||
| 4 | 1920 | 23040 | 77760 | 103680 | 48600 | 255000 | ||||||||||
| 5 | 23040 | 345600 | 1555200 | 3110400 | 2916000 | 1049760 | 9000000 | |||||||||
| 6 | 322560 | 5806080 | 32659200 | 87091200 | 122472000 | 88179840 | 25719120 | 362250000 | ||||||||
| 7 | 5160960 | 108380160 | 731566080 | 2438553600 | 4572288000 | 4938071040 | 2880541440 | 705438720 | 16380000000 | |||||||
| 8 | 92897280 | 2229534720 | 17557585920 | 70230343680 | 164602368000 | 237027409920 | 207398983680 | 101583175680 | 21427701120 | 822150000000 | ||||||
| 9 | 1857945600 | 50164531200 | 451480780800 | 2106910310400 | 5925685248000 | 10666233446400 | 12443939020800 | 9142485811200 | 3856986201600 | 714256704000 | 45360000000000 | |||||
| 10 | 40874803200 | 1226244096000 | 12415721472000 | 66217181184000 | 217275125760000 | 469314271641600 | 684416646144000 | 670448959488000 | 424268482176000 | 157136474880000 | 25927518355200 | 2728687500000000 | ||||
| 11 | 980995276800 | 32372844134400 | 364194496512000 | 2185166979072000 | 8194376171520000 | 20649827952230400 | 36137198916403200 | 44249631326208000 | 37335626431488000 | 20742014684160000 | 6844864845772800 | 1018244357222400 | 177754500000000000 | |||
| 12 | 25505877196800 | 918211579084800 | 11362868291174400 | 75752455274496000 | 319580670689280000 | 920392331585126400 | 1879134343652966400 | 2761176994755379200 | 2912178861656064000 | 2157169527152640000 | 1067798915940556800 | 317692239453388800 | 43020824092646400 | 12466203750000000000 | ||
| 13 | 714164561510400 | 27852417898905600 | 376007641635225600 | 2757389371991654400 | 12925262681210880000 | 41877851087123251200 | 97714985869954252800 | 167511404348493004800 | 212006621128561459200 | 196302426970890240000 | 129559601800787558400 | 57819987580516761600 | 15659579969723289600 | 1945864966652006400 | 936485550000000000000 | |
| 14 | 21424936845312000 | 899847347503104000 | 13160267457232896000 | 105282139657863168000 | 542861032610856960000 | 1954299717399085056000 | 5130036758172598272000 | 10050684260909580288000 | 14840463478999302144000 | 16489403865554780160000 | 13603758189082693632000 | 8094798261272346624000 | 3288511793641890816000 | 817263285993842688000 | 93818489463578880000 | 75025262812500000000000 |
Compute more
?
Technical details
- Node id
n-cf28bf26a0e97b2b· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-311883d116e971c2
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, 12; 2: 24, 144, 162; 3: 192, 1728, 3888, 2592; 4: 1920, 23040, 77760, 103680, 48600; 5: 23040, 345600, 1555200, 3110400, 2916000, 1049760; 6: 322560, 5806080, 32659200, 87091200, 122472000, 88179840, 25719120; 7: 5160960, 108380160, 731566080, 2438553600, 4572288000, 4938071040, 2880541440, 705438720; 8: 92897280, 2229534720, 17557585920, 70230343680, 164602368000, 237027409920, 207398983680, 101583175680, 21427701120; 9: 1857945600, 50164531200, 451480780800, 2106910310400, 5925685248000, 10666233446400, 12443939020800, 9142485811200, 3856986201600, 714256704000;
%F FormulaThe row polynomials satisfy (2+3*n*x)*P(n,x) = (4*n+4+(6*n^2+18*n+12)*x+(9*n^2+18*n+9)*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[((4*n + 4 + (6*n^2 + 18*n + 12)*x + (9*n^2 + 18*n + 9)*x^2)*P[n - 1, x])/(2 + 3*n*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 + 4 + (6*n^2 + 18*n + 12)*x + (9*n^2 + 18*n + 9)*x^2)*v[i - 1])/(2 + 3*n*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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013610 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (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) [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.?
-
Geometric basis map (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)
- ↑ 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.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (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)
- ↑ 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.?
-
Geometric basis map (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)
- ↑ 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.?
-
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)
- ↑ 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_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A013610 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- A085880 → basis A013610 → θ+1
- A178822 → basis A013610 → θ+1
- A038208 → basis A013610 → θ+1
- A178820 → basis A013610 → θ+1
- A013620 → θ+1
- A038338 → basis A013610 → θ+1
- A178821 → basis A013610 → θ+1
- A196347 → basis A013610 → θ+1
- A028326 → basis A013610 → θ+1
- A038221 → basis A013610 → θ+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.