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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185219 Number of disconnected regular simple graphs on n vertices with girth at least 9. 3
0, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 7, 9, 9, 12, 12, 15, 16, 19, 20, 25, 26, 31, 34, 40, 43, 51, 55, 64, 71, 81, 89, 103, 113, 129, 143, 162, 179, 204, 225, 254, 282, 317, 351, 396, 437, 490, 544, 608, 673, 753, 832, 928, 1028, 1144, 1264 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Jason Kimberley, Table of n, a(n) for n = 0..116

Jason Kimberley, Index of sequences counting disconnected k-regular simple graphs with girth at least g

EXAMPLE

a(116) = 89574 because there is 1 such 0-regular graph (116 disconnected vertices), 1 such 1-regular graph (58 loose edges), A185229(116) = 89401, and 171 such 3-regular graphs (because A210709(58)=18).

CROSSREFS

Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), A185218 (g=8), this sequence (g=9).

Sequence in context: A161063 A161267 A161292 * A161319 A161253 A161038

Adjacent sequences:  A185216 A185217 A185218 * A185220 A185221 A185222

KEYWORD

nonn,hard

AUTHOR

Jason Kimberley, Dec 19 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 00:16 EDT 2021. Contains 345154 sequences. (Running on oeis4.)