login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204596 Number of connected non-isomorphic well-covered circulant graphs on n nodes (excluding the complete graph). 1
1, 1, 2, 1, 2, 2, 4, 3, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
4,3
REFERENCES
Brown, Jason; and Hoshino, Richard; Well-covered circulant graphs. Discrete Math. 311 (2011), no. 4, 244-251.
LINKS
CROSSREFS
Cf. A204597.
Sequence in context: A184199 A262346 A242560 * A324387 A163373 A117193
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jan 17 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)