%I #7 May 01 2014 02:37:02

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

%T 14,158,4356,266556,20812581

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

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

%K nonn,more,hard

%O 0,34

%A _Jason Kimberley_, Feb 22 2011