|
%I #11 May 01 2014 02:37:01
%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,98176518258
%N Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 6.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_eq_g_index">Index of sequences counting disconnected k-regular simple graphs with girth exactly g</a>
%F a(n) = A185236(n) - A185237(n).
%Y Disconnected 3-regular simple graphs with girth exactly g: A185033 (g=3), A185034 (g=4), A185035 (g=5), this sequence (g=6), A185037 (g=7).
%K nonn,more,hard
%O 0,17
%A _Jason Kimberley_, Feb 29 2012
|
