%I #4 Apr 03 2012 11:57:17
%S 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,3,0,21,0,545,0,
%T 30368,0,1782839,0,95079080,0,4686063107,0
%N Number of connected regular simple graphs on n vertices with girth exactly 7.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_eq_g_index">Index of sequences counting connected k-regular simple graphs with girth exactly g</a>
%F a(n) = A186727(n) - A186728(n).
%K nonn,more,hard
%O 0,27
%A _Jason Kimberley_, Apr 03 2012