login
A204597
Number of connected non-isomorphic well-covered circulant graphs on n nodes (including the complete graph).
1
1, 2, 2, 3, 2, 3, 3, 5, 4, 14
OFFSET
3,2
REFERENCES
Brown, Jason; and Hoshino, Richard; Well-covered circulant graphs. Discrete Math. 311 (2011), no. 4, 244-251.
CROSSREFS
Cf. A204596.
Sequence in context: A057334 A375674 A048475 * A285734 A051698 A046773
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jan 17 2012
STATUS
approved