A156992 → basis A013610 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + 3\,x + 3\,n\right)\,P_{n}(x) = \left(4 + 12\,x + 9\,x^{2} + 10\,n + 21\,n x + 9\,n x^{2} + 6\,n^{2} + 9\,n^{2} 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 | 10 | 6 | 16 | |||||||||||||
| 2 | 96 | 180 | 54 | 330 | ||||||||||||
| 3 | 1056 | 3456 | 3240 | 648 | 8400 | |||||||||||
| 4 | 13440 | 63360 | 103680 | 64800 | 9720 | 255000 | ||||||||||
| 5 | 195840 | 1209600 | 2851200 | 3110400 | 1458000 | 174960 | 9000000 | |||||||||
| 6 | 3225600 | 24675840 | 76204800 | 119750400 | 97977600 | 36741600 | 3674160 | 362250000 | ||||||||
| 7 | 59351040 | 541900800 | 2072770560 | 4267468800 | 5029516800 | 3292047360 | 1028764800 | 88179840 | 16380000000 | |||||||
| 8 | 1207664640 | 12819824640 | 58525286400 | 149239480320 | 230443315200 | 217275125760 | 118513704960 | 31744742400 | 2380855680 | 822150000000 | ||||||
| 9 | 26940211200 | 326069452800 | 1730676326400 | 5267275776000 | 10073664921600 | 12443939020800 | 9777380659200 | 4571242905600 | 1071385056000 | 71425670400 | 45360000000000 | |||||
| 10 | 653996851200 | 8890269696000 | 53801459712000 | 190374395904000 | 434550251520000 | 664861884825600 | 684416646144000 | 460933659648000 | 188563769856000 | 39284118720000 | 2357047123200 | 2728687500000000 | ||||
| 11 | 17167417344000 | 258982753075200 | 1760273399808000 | 7101792681984000 | 18847065194496000 | 34416379920384000 | 43880884398489600 | 38718427410432000 | 22816216152576000 | 8296805873664000 | 1555651101312000 | 84853696435200 | 177754500000000000 | |||
| 12 | 484611666739200 | 8034351316992000 | 60601964219596800 | 274602650370048000 | 830909743792128000 | 1764085302204825600 | 2684477633789952000 | 2933750556927590400 | 2265028003510272000 | 1186443239933952000 | 388290514887475200 | 66185883219456000 | 3309294160972800 | 12466203750000000000 | ||
| 13 | 14640373510963200 | 264597970039603200 | 2193377909538816000 | 11029557487966617600 | 37483261775511552000 | 90735344022100377600 | 160531762500639129600 | 209389255435616256000 | 200228475510308044800 | 137411698879623168000 | 64779800900393779200 | 19273329193505587200 | 3011457686485248000 | 138990354760857600 | 936485550000000000000 | |
| 14 | 471348610596864000 | 9223435311906816000 | 83348360562475008000 | 460609361003151360000 | 1737155304354742272000 | 4722890983714455552000 | 9527211122320539648000 | 14447858625057521664000 | 16489403865554780160000 | 14015993285721563136000 | 8656937029416259584000 | 3710115869749825536000 | 1011849782659043328000 | 145939872498900480000 | 6254565964238592000 | 75025262812500000000000 |
Compute more
?
Technical details
- Node id
n-8c70341227dc569b· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-bff12ef9596281bf
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: 10, 6; 2: 96, 180, 54; 3: 1056, 3456, 3240, 648; 4: 13440, 63360, 103680, 64800, 9720; 5: 195840, 1209600, 2851200, 3110400, 1458000, 174960; 6: 3225600, 24675840, 76204800, 119750400, 97977600, 36741600, 3674160; 7: 59351040, 541900800, 2072770560, 4267468800, 5029516800, 3292047360, 1028764800, 88179840; 8: 1207664640, 12819824640, 58525286400, 149239480320, 230443315200, 217275125760, 118513704960, 31744742400, 2380855680; 9: 26940211200, 326069452800, 1730676326400, 5267275776000, 10073664921600, 12443939020800, 9777380659200, 4571242905600, 1071385056000, 71425670400;
%F FormulaThe row polynomials satisfy (3*n-1+3*x)*P(n,x) = (6*n^2+10*n+4+(9*n^2+21*n+12)*x+(9*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[((6*n^2 + 10*n + 4 + (9*n^2 + 21*n + 12)*x + (9*n + 9)*x^2)*P[n - 1, x])/(3*n - 1 + 3*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] = ((6*n^2 + 10*n + 4 + (9*n^2 + 21*n + 12)*x + (9*n + 9)*x^2)*v[i - 1])/(3*n - 1 + 3*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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] 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 ?
- A196347 → basis A013610 → D+1
- A038221 → basis A013610 → D+1
- A013620 → D+1
- A028326 → basis A013610 → D+1
- A178821 → basis A013610 → D+1
- A085880 → basis A013610 → D+1
- A038208 → basis A013610 → D+1
- A178820 → basis A013610 → D+1
- A178822 → basis A013610 → D+1
- A038338 → basis A013610 → D+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.