%I #7 Feb 22 2013 12:00:03

%S 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,1,1,1,1,1,2,2,3,4,4,7,5,27,7,553,10,

%T 30379,13,1782854,18,95079100,24,4686063134,32

%N Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 7.

%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_eq_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g</a>

%F a(n) = A186747(n) + A210717(n).

%F a(n) = A185317(n) - A185318(n).

%Y Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), A198316 (g=6), this sequence (g=7), A198318 (g=8).

%K nonn,more,hard

%O 0,22

%A _Jason Kimberley_, Dec 18 2012