|
%I #14 May 01 2014 02:37:07
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,5,25,297,8199,377004,22014143,
%T 1493574756,114880777582,9919463450854
%N Number of disconnected 6-regular simple graphs on n vertices with girth exactly 3.
%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) = A165656(n) - A185264(n).
%Y Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: A185033 (k=3), A185043 (k=4), A185053 (k=5), this sequence (k=6).
%K nonn,more,hard
%O 0,17
%A _Jason Kimberley_, Mar 10 2012
|
