|
|
A277584
|
|
a(n) = binomial(3n-1, n-1)^2.
|
|
1
|
|
|
0, 1, 25, 784, 27225, 1002001, 38291344, 1502337600, 60101954649, 2440703175625, 100300325150025, 4161829109817600, 174077451630810000, 7330421677037621904, 310467090932230849600, 13214837914326197526784, 564927069263895118093401
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
Let the number of multisets of length k on n symbols be denoted by ((n, k)) = binomial(n+k-1, k).
a(n) = (Sum_{k=0..n} binomial(n, k)^2 * ((2*n, 2*n - k)))/5 for n > 0.
|
|
MATHEMATICA
|
Table[Boole[n > 0] Binomial[3 n - 1, n - 1]^2, {n, 0, 16}] (* Michael De Vlieger, Oct 26 2016 *)
|
|
PROG
|
(PARI) a(n) = binomial(3*n-1, n-1)^2; \\ Michel Marcus, Oct 22 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|