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 A185035 #11 May 01 2014 02:37:01 %S A185035 0,0,0,0,0,0,0,0,0,0,1,2,12,67,597,7134,107820,1876672,35924730, %T A185035 741405102,16356067055,383931363314 %N A185035 Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 5. %H A185035 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 A185035 a(n) = A185235(n) - A185236(n). %Y A185035 Disconnected 3-regular simple graphs with girth exactly g: A185033 (g=3), A185034 (g=4), this sequence (g=5), A185036 (g=6), A185037 (g=7). %K A185035 nonn,more,hard %O A185035 0,12 %A A185035 _Jason Kimberley_, Feb 29 2012