login
Number of disconnected regular simple graphs on n vertices with girth exactly 6.
1

%I #4 Dec 12 2012 11:25:32

%S 0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,2,2,3,3,4,4,6,6,8,9,12,12,17,17,

%T 27,24,66,32,472,44,8172,60,191325,80,4856015,107,127937980,143,

%U 3482858430,188,98176518479,248

%N Number of disconnected regular simple graphs on n 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) = A185216(n) - A185217(n).

%K nonn,more,hard

%O 0,19

%A _Jason Kimberley_, Dec 10 2012