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 A198317 #7 Feb 22 2013 12:00:03 %S A198317 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,1,1,1,1,1,2,2,3,4,4,7,5,27,7,553,10, %T A198317 30379,13,1782854,18,95079100,24,4686063134,32 %N A198317 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 7. %H A198317 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_eq_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g</a> %F A198317 a(n) = A186747(n) + A210717(n). %F A198317 a(n) = A185317(n) - A185318(n). %Y A198317 Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), A198316 (g=6), this sequence (g=7), A198318 (g=8). %K A198317 nonn,more,hard %O A198317 0,22 %A A198317 _Jason Kimberley_, Dec 18 2012