|
%I #7 Feb 22 2013 10:48:32
%S 0,0,0,0,0,1,0,0,0,0,2,1,3,1,9,2,50,3,453,5,5759,14,90693,3926,
%T 1736786,4132004,163458044,4018022167,119021971966
%N Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 5.
%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) = A186745(n) + A210715(n).
%F a(n) = A185315(n) - A185316(n).
%Y Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), this sequence (g=5), A198316 (g=6), A198317 (g=7), A198318 (g=8).
%K nonn,more,hard
%O 0,11
%A _Jason Kimberley_, Dec 13 2012
|
