|
|
A064350
|
|
a(n) = (3*n)!/n!.
|
|
10
|
|
|
1, 6, 360, 60480, 19958400, 10897286400, 8892185702400, 10137091700736000, 15388105201717248000, 30006805143348633600000, 73096577329197271449600000, 217535414131691079834009600000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is the number of ways to partition the set {1,2,...,3n} into n blocks of size 3 and then linearly order the elements within each block. - Geoffrey Critzer, Dec 30 2012
|
|
LINKS
|
|
|
FORMULA
|
Integral representation as n-th moment of a positive function on a positive half-axis, in Maple notation: a(n)=int(x^n*BesselK(1/3, 2*sqrt(x/27))/(3*Pi*sqrt(x)), x=0..infinity), n=0, 1, ...
A recursive formula: a(n) = (27 * (n - 1)^2 + 27 * (n - 1) + 6) * a(n - 1) with a(0) = 1. An explicit formula following from the recursion equation: a(n) = (3/2)*27^n*GAMMA(n+2/3)*GAMMA(n+1/3)/(Pi*3^(1/2)). - Thomas Wieder, Nov 15 2004
E.g.f.: (of aerated sequence) 2*cos(arcsin((3*sqrt(3)*x/2)/3))/sqrt(4-27*x^2). - Paul Barry, Jul 27 2010
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) { t=f=1; for (n=0, 70, if (n, t*=3*n*(3*n - 1)*(3*n - 2); f*=n); write("b064350.txt", n, " ", t/f) ) } \\ Harry J. Smith, Sep 12 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|