|
|
A185227
|
|
Number of disconnected 2-regular simple graphs on n vertices with girth at least 7.
|
|
12
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 10, 12, 14, 17, 19, 23, 26, 31, 35, 41, 47, 55, 62, 72, 82, 95, 107, 124, 140, 161, 182, 208, 235, 269, 303, 345, 389, 442, 497, 564, 634, 718, 806, 910, 1021, 1152, 1290, 1452, 1627, 1828, 2044, 2294
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,17
|
|
COMMENTS
|
Number of partitions of n with each part at least 7, and at least 2 parts.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(Magma) A185227 := func<n|n eq 0 select 0 else #RestrictedPartitions(n, {7..n-1})>;
|
|
CROSSREFS
|
Disconnected k-regular simple graphs with girth at least 7: A185217 (all k), A185207 (triangle); this sequence (k=2), A185237 (k=3).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|