The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #9 May 01 2014 02:37:07
%S 0,0,0,0,0,0,0,1,1,5,32,385,7573,181224,4624481,122089999,3328899592,
%T 93988909792
%N Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 6.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_eq_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g</a>
%F a(n) = A006926(n) + A185036(n).
%Y Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), A185135 (g=5), this sequence (g=6).
%K nonn,hard,more
%O 0,10
%A _Jason Kimberley_, Mar 21 2012