|
%I #14 May 01 2014 02:37:01
%S 0,0,0,0,1,2,8,29,138,774,5678,53324,622716,8604351,135344959,
%T 2363662004,45134533117,933058713014,20735549517852,492653820710746
%N Number of disconnected 3-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) = A165653(n) - A185234(n).
%Y Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: this sequence (k=3), A185043 (k=4), A185053 (k=5), A185063 (k=6).
%Y Disconnected 3-regular simple graphs with girth exactly g: this sequence (g=3), A185034 (g=4), A185035 (g=5), A185036 (g=6), A185037 (g=7).
%K nonn,more,hard
%O 0,6
%A _Jason Kimberley_, Feb 29 2012
|
