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 A185037 #11 May 01 2014 02:37:01 %S A185037 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,27,609,32237, %T A185037 1885410,101214661,5025320937 %N A185037 Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 7. %H A185037 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_eq_g_index">Index of sequences counting disconnected k-regular simple graphs with girth exactly g</a> %F A185037 a(n) = A185237(n) - A185238(n). %Y A185037 Disconnected 3-regular simple graphs with girth exactly g: A185033 (g=3), A185034 (g=4), A185035 (g=5), A185036 (g=6), this sequence (g=7). %K A185037 nonn,more,hard %O A185037 0,26 %A A185037 _Jason Kimberley_, Feb 29 2012