|
%I #8 May 01 2014 02:37:03
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,9,749,2888270
%N Number of disconnected 7-regular simple graphs on 2n vertices with girth at least 4.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a>
%Y Disconnected k-regular simple graphs with girth at least 4: A185214 (any k), A185204 (triangle); specified degree k: A185224 (k=2), A185234 (k=3), A185244 (k=4), A185254 (k=5), A185264 (k=6), this sequence (k=7), A185284 (k=8), A185294 (k=9).
%K nonn,more,hard
%O 0,17
%A _Jason Kimberley_, Feb 22 2011
|
