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 A184974 #17 May 01 2014 02:37:01 %S A184974 0,0,0,0,0,0,0,1,1,8,741,2887493 %N A184974 Number of connected 7-regular simple graphs on 2n vertices with girth exactly 4. %H A184974 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> %F A184974 a(n) = A186714(n,5) - A186715(n,5). %e A184974 a(0)=0 because even though the null graph (on zero vertices) is vacuously 7-regular and connected, since it is acyclic, it has infinite girth. %e A184974 The a(7)=1 graph is the complete bipartite graph K_{7,7}. %Y A184974 Connected k-regular simple graphs with girth exactly 4: A006924 (k=3), A184944 (k=4), A184954 (k=5), A184964 (k=6), this sequence (k=7). %Y A184974 Connected 7-regular simple graphs with girth at least g: A014377 (g=3), A181153 (g=4). %Y A184974 Connected 7-regular simple graphs with girth exactly g: A184973 (g=3), this sequence (g=4). %K A184974 nonn,more,hard %O A184974 0,10 %A A184974 _Jason Kimberley_, Feb 28 2011