The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #13 May 01 2014 02:37:02
%S 0,0,0,0,0,0,0,0,0,0,1,1,8,395,407240,1125431866,3814677304834
%N Number of disconnected 5-regular simple graphs on 2n vertices with girth at least 4.
%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 5-regular simple graphs on 2n vertices with girth at least 4: A058275 (connected), this sequence (disconnected), A185354 (not necessarily connected).
%Y Disconnected k-regular simple graphs with girth at least 4: A185214 (any k), A185204 (triangle); specified degree k: A185224 (k=2), A185234 (k=3), A185244 (k=4), this sequence (k=5), A185264 (k=6), A185274 (k=7), A185284 (k=8), A185294 (k=9).
%K nonn,hard,more
%O 0,13
%A _Jason Kimberley_, Feb 22 and Nov 04 2011