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 A185053 #13 May 01 2014 02:37:06 %S A185053 0,0,0,0,0,0,1,3,66,8029,3484759,2595985769,2815099031409 %N A185053 Number of disconnected 5-regular simple graphs on 2n vertices with girth exactly 3. %H A185053 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 A185053 a(n) = A165655(n) - A185254(n). %Y A185053 Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: A185033 (k=3), A185043 (k=4), this sequence (k=5), A185063 (k=6). %K A185053 nonn,hard,more %O A185053 0,8 %A A185053 _Jason Kimberley_, Mar 10 2012