%I #14 May 01 2014 02:37:02
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,6,37,432,8119,191254,4855919,
%T 127937854,3482858263,98176518259
%N Number of disconnected 3-regular simple graphs on 2n vertices with girth at least 6.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_girth_ge_6">Disconnected regular graphs with girth at least 6</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 k-regular simple graphs with girth at least 6: A185216 (all k), A185206 (triangle); A185226 (k=2), this sequence (k=3), A185246 (k=4).
%K nonn,more,hard
%O 0,17
%A _Jason Kimberley_, Feb 22 2011