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!)
 A185246 Number of disconnected 4-regular simple graphs on n vertices with girth at least 6. 7
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 5, 0, 23, 0, 1301, 25, 495379, 13529 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,57 LINKS Jason Kimberley, Disconnected regular graphs with girth at least 6 FORMULA a(n) = A185346(n) - A058348(n) = Euler_transformation(A058348)(n) - A058348(n). CROSSREFS 4-regular simple graphs with girth at least 4: A058348 (connected), this sequence (disconnected), A185346 (not necessarily connected). Disconnected 4-regular simple graphs with girth at least g: A033483 (g=3), A185244 (g=4), A185245 (g=5), this sequence (g=6). Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), A185206 (triangle); A185226 (k=2), A185236 (k=3), this sequence (k=4). Sequence in context: A284177 A222755 A279500 * A279547 A279700 A279603 Adjacent sequences:  A185243 A185244 A185245 * A185247 A185248 A185249 KEYWORD nonn,more,hard AUTHOR Jason Kimberley, Feb 22 2011 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 12 14:45 EDT 2021. Contains 344957 sequences. (Running on oeis4.)