|
| |
|
|
A051578
|
|
(2*n+4)!!/4!!, related to A000165 (even double factorials).
|
|
2
| |
|
|
1, 6, 48, 480, 5760, 80640, 1290240, 23224320, 464486400, 10218700800, 245248819200, 6376469299200, 178541140377600, 5356234211328000, 171399494762496000, 5827582821924864000, 209792981589295104000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Row m=4 of the array A(3; m,n) := (2*n+m)!!/m!!, m >= 0, n >= 0.
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 521
|
|
|
FORMULA
| a(n) = (2*n+4)!!/4!!; e.g.f.: 1/(1-2*x)^3.
a(n) ~ 2^(-1/2)*pi^(1/2)*n^(5/2)*2^n*e^-n*n^n*{1 + 37/12*n^-1 + ...}. - Joe Keane (jgk(AT)jgk.org), Nov 23 2001
a(n)=n!*2^(n-3), n>=2 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 23 2006
a(n)=2^n*A001710(n+2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 22 2008
|
|
|
MAPLE
| seq(count(Permutation(n))*count(Composition(n))/4, n=2..18); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 16 2006
|
|
|
MATHEMATICA
| s=1; lst={s}; Do[s+=(s*=n); AppendTo[lst, s], {n, 3, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 15 2008]
|
|
|
CROSSREFS
| Cf. A000165, A001147(n+1), A002866(n+1), A051577 (rows m=0..3).
Sequence in context: A085457 A188911 A105627 * A052639 A053506 A055861
Adjacent sequences: A051575 A051576 A051577 * A051579 A051580 A051581
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)
|
| |
|
|
