%I #7 Jan 02 2022 17:24:46
%S 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
%T 1,0,3,0,13,0,155,0,4337,0,266362,0,20807688,0
%N Number of connected regular simple graphs on n vertices with girth exactly 8.
%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) = A186728(n) - A186729(n).
%Y Cf. A186728, A186729.
%K nonn,more,hard
%O 0,37
%A _Jason Kimberley_, Apr 03 2012