|
%I #7 Feb 22 2013 10:46:50
%S 1,1,2,1,2,1,2,1,3,2,3,2,3,2,3,2,4,3,5,4,6,5,7,6,9,8,11,11,14,14,19,
%T 18,23,24,30,31,41,40,61,52,217,67,4416,86,266463,111,20807816,141
%N Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 8.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_ge_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth at least g</a>
%F a(n) = A186728(n) + A185218(n).
%Y Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), A185316 (g=6), A185317 (g=7), this sequence (g=8), A185319 (g=9).
%K nonn,more,hard
%O 0,3
%A _Jason Kimberley_, Dec 18 2012
|
