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 A198316 #7 Feb 22 2013 10:48:30 %S A198316 0,0,0,0,0,0,1,0,0,0,0,0,1,1,2,1,2,1,7,2,35,3,389,4,7579,6,181233,9, %T A198316 4624493,12,122090019,17,3328899632,24,93988911093,57 %N A198316 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 6. %H A198316 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 A198316 a(n) = A186746(n) + A210716(n). %F A198316 a(n) = A185316(n) - A185317(n). %Y A198316 Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), this sequence (g=6), A198317 (g=7), A198318 (g=8). %K A198316 nonn,more,hard %O A198316 0,15 %A A198316 _Jason Kimberley_, Dec 13 2012