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 A198314 #9 Feb 22 2013 10:47:09 %S A198314 0,0,0,0,1,0,1,0,4,1,8,3,37,33,335,1610,17985,193911,2867313,32674066, %T A198314 1581626531,6705889862 %N A198314 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 4. %H A198314 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 A198314 a(n) = A186744(n) + A210714(n). %F A198314 a(n) = A185314(n) - A185315(n). %Y A198314 Not necessarily connected k-regular simple graphs girth exactly 4: this sequence (any k), A185644 (triangle); fixed k: A026797 (k=2), A185134 (k=3), A185144 (k=4). %Y A198314 Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), this sequence (g=4), A198315 (g=5), A198316 (g=6), A198317 (g=7), A198318 (g=8). %K A198314 nonn,more,hard %O A198314 0,9 %A A198314 _Jason Kimberley_, Dec 12 2012 %E A198314 a(10) corrected from 9 to 8 by _Jason Kimberley_, Feb 22 2013