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 A205295 #7 May 01 2014 02:36:27 %S A205295 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,90 %N A205295 Number of connected 5-regular simple graphs on 2n vertices with girth at least 5. %D A205295 M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146. %H A205295 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_ge_g_index">Index of sequences counting connected k-regular simple graphs with girth at least g</a> %H A205295 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">Tables of Regular Graphs</a> %Y A205295 Connected k-regular simple graphs with girth at least 5: A185115 (k=2), A014372 (k=3), A058343 (k=4), this sequence (k=5). %Y A205295 Connected 5-regular simple graphs with girth at least g: A006821 (g=3), A058275 (g=4), this sequence (g=5). %Y A205295 Connected 5-regular simple graphs with girth exactly g: A184953 (g=3), A184954 (g=4), A184955 (g=5). %K A205295 nonn,more,hard %O A205295 0,16 %A A205295 _Jason Kimberley_, Jan 25 2012