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 A186748 #7 Jan 02 2022 17:24:46 %S A186748 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0, %T A186748 1,0,3,0,13,0,155,0,4337,0,266362,0,20807688,0 %N A186748 Number of connected regular simple graphs on n vertices with girth exactly 8. %H A186748 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 A186748 a(n) = A186728(n) - A186729(n). %Y A186748 Cf. A186728, A186729. %K A186748 nonn,more,hard %O A186748 0,37 %A A186748 _Jason Kimberley_, Apr 03 2012