|
%I #13 May 01 2014 02:37:06
%S 0,0,0,0,0,0,1,3,66,8029,3484759,2595985769,2815099031409
%N Number of disconnected 5-regular simple graphs on 2n 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) = A165655(n) - A185254(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), this sequence (k=5), A185063 (k=6).
%K nonn,hard,more
%O 0,8
%A _Jason Kimberley_, Mar 10 2012
|
