%I #8 May 19 2017 01:19:20
%S 0,0,0,0,0,1,0,0,0,0,1,0,2,0,8,0,48,0,450,1,5753,8,90684,3917,1736764,
%T 4131991,163457964,4018022149,119021971348
%N Number of connected regular simple graphs on n vertices with girth exactly 5.
%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) = A186725(n) - A186726(n).
%K nonn,more,hard
%O 0,13
%A _Jason Kimberley_, Apr 03 2012
%E a(26) corrected by the author, due to correction of A186725, May 19 2017
|