|
%I #7 Feb 22 2013 10:48:30
%S 0,0,0,0,0,0,1,0,0,0,0,0,1,1,2,1,2,1,7,2,35,3,389,4,7579,6,181233,9,
%T 4624493,12,122090019,17,3328899632,24,93988911093,57
%N Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 6.
%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) = A186746(n) + A210716(n).
%F a(n) = A185316(n) - A185317(n).
%Y Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), this sequence (g=6), A198317 (g=7), A198318 (g=8).
%K nonn,more,hard
%O 0,15
%A _Jason Kimberley_, Dec 13 2012
|
