|
|
A185228
|
|
Number of disconnected 2-regular simple graphs on n vertices with girth at least 8.
|
|
8
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 6, 6, 8, 9, 11, 12, 15, 16, 20, 22, 26, 29, 35, 38, 45, 50, 59, 65, 76, 84, 98, 109, 125, 139, 161, 178, 204, 227, 259, 288, 328, 364, 414, 460, 520, 578, 654, 725, 817, 908, 1021, 1133
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,19
|
|
COMMENTS
|
Number of partitions of n with each part at least 8, and at least 2 parts.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(Magma) A185228 := func<n|n eq 0 select 0 else #RestrictedPartitions(n, {8..n-1})>;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|