|
| |
|
|
A370367
|
|
Number of partitions of [n^2] into n sets of size n having no set of consecutive numbers whose maximum (if k>n) is a multiple of n.
|
|
3
|
|
|
|
1, 0, 2, 252, 2604732, 5192229797500, 3708511647508346445685, 1461034020983306348666869275743970, 450538781472323736156501178553451135548626208528, 146413934881756079673947032145931312279368061228255235014292945848
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n) = Sum_{j=0..n} (-1)^(n-j)*binomial(n,j)*(n*j)!/(j!*n!^j).
|
|
|
EXAMPLE
|
a(2) = 2: 13|24, 14|23.
|
|
|
MAPLE
|
a:= n-> add((-1)^(n-j)*binomial(n, j)*(n*j)!/(j!*n!^j), j=0..n):
seq(a(n), n=0..10);
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
