|
|
A215770
|
|
Number of undirected labeled graphs on n nodes with exactly 10 cycle graphs as connected components.
|
|
2
|
|
|
1, 55, 1705, 40755, 864864, 17597580, 357501430, 7394469940, 157152692697, 3447161882307, 78214593177825, 1837521249630885, 44711396042691202, 1126629665018647306, 29386149075365532659, 792965839703648696250, 22122127578168037696705, 637598054468679136895205
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
10,2
|
|
LINKS
|
|
|
MAPLE
|
T:= proc(n, k) option remember; `if`(k<0 or k>n, 0, `if`(n=0, 1,
add(binomial(n-1, i)*T(n-1-i, k-1)*ceil(i!/2), i=0..n-k)))
end:
a:= n-> T(n, 10):
seq (a(n), n=10..30);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|