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 A186746 #8 Mar 02 2020 09:35:21 %S A186746 0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,5,0,32,0,385,0,7573,0,181225,0, %T A186746 4624481,0,122090002,0,3328899605,0,93988911027,25,2754128020324,13504 %N A186746 Number of connected regular simple graphs on n vertices with girth exactly 6. %H A186746 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 A186746 a(n) = A186726(n) - A186727(n). %Y A186746 Cf. A186726, A186727. %K A186746 nonn,more,hard %O A186746 0,19 %A A186746 _Jason Kimberley_, Apr 03 2012 %E A186746 a(36)-a(37) from _Jinyuan Wang_, Mar 02 2020