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!)
A185218 Number of disconnected regular simple graphs on n vertices with girth at least 8. 5

%I

%S 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,

%T 17,22,23,28,30,37,39,47,51,61,66,78,85,100,110,127,140,163,179,206,

%U 228,261,289,330,365,416,461,522,579,657,726,819,909,1024,1134,1277,1411

%N Number of disconnected regular simple graphs on n vertices with girth at least 8.

%H Jason Kimberley, <a href="/A185218/b185218.txt">Table of n, a(n) for n = 0..77</a>

%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a>

%Y 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).

%K nonn,hard

%O 0,5

%A _Jason Kimberley_, Dec 14 2012

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 August 4 21:32 EDT 2021. Contains 346455 sequences. (Running on oeis4.)