This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A186745 #8 May 19 2017 01:19:20 %S A186745 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 A186745 4131991,163457964,4018022149,119021971348 %N A186745 Number of connected regular simple graphs on n vertices with girth exactly 5. %H A186745 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 A186745 a(n) = A186725(n) - A186726(n). %K A186745 nonn,more,hard %O A186745 0,13 %A A186745 _Jason Kimberley_, Apr 03 2012 %E A186745 a(26) corrected by the author, due to correction of A186725, May 19 2017