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 A184955 #17 May 01 2014 02:37:01 %S A184955 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,90 %N A184955 Number of connected 5-regular simple graphs on 2n vertices with girth exactly 5. %H A184955 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_eq_g_index">Index of sequences counting connected k-regular simple graphs with girth exactly g</a> %Y A184955 Connected k-regular simple graphs with girth exactly 5: A185015 (k=2), A006925 (k=3), A184945 (k=4), this sequence (k=5). %Y A184955 Connected 5-regular simple graphs with girth at least g: A006821 (g=3), A058275 (g=4), A205295 (g=5). %Y A184955 Connected 5-regular simple graphs with girth exactly g: A184953 (g=3), A184954 (g=4), this sequence (g=5). %K A184955 nonn,more,hard %O A184955 0,16 %A A184955 _Jason Kimberley_, Feb 27 2011