The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185218 Number of disconnected regular simple graphs on n vertices with girth at least 8. 5
 0, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 8, 7, 10, 10, 13, 13, 17, 17, 22, 23, 28, 30, 37, 39, 47, 51, 61, 66, 78, 85, 100, 110, 127, 140, 163, 179, 206, 228, 261, 289, 330, 365, 416, 461, 522, 579, 657, 726, 819, 909, 1024, 1134, 1277, 1411 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Jason Kimberley, Table of n, a(n) for n = 0..77 CROSSREFS Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), this sequence (g=8). Sequence in context: A161061 A161265 A161290 * A161317 A161251 A161036 Adjacent sequences:  A185215 A185216 A185217 * A185219 A185220 A185221 KEYWORD nonn,hard AUTHOR Jason Kimberley, Dec 14 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 14 09:06 EDT 2021. Contains 345018 sequences. (Running on oeis4.)