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 A198318 #7 Feb 22 2013 10:48:34 %S A198318 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,2,3,3,4,4,6,5,7,7, %T A198318 10,10,15,13,29,17,176,23,4364,30,266398,39,20807734,51 %N A198318 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 8. %H A198318 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 A198318 a(n) = A186748(n) + A210718(n). %F A198318 a(n) = A185318(n) - A185319(n). %Y A198318 Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), A198316 (g=6), A198317 (g=7), this sequence (g=8). %K A198318 nonn,more,hard %O A198318 0,25 %A A198318 _Jason Kimberley_, Dec 19 2012