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 A186747 #4 Apr 03 2012 11:57:17 %S A186747 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,3,0,21,0,545,0, %T A186747 30368,0,1782839,0,95079080,0,4686063107,0 %N A186747 Number of connected regular simple graphs on n vertices with girth exactly 7. %H A186747 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 A186747 a(n) = A186727(n) - A186728(n). %K A186747 nonn,more,hard %O A186747 0,27 %A A186747 _Jason Kimberley_, Apr 03 2012