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 A185063 #14 May 01 2014 02:37:07 %S A185063 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,5,25,297,8199,377004,22014143, %T A185063 1493574756,114880777582,9919463450854 %N A185063 Number of disconnected 6-regular simple graphs on n vertices with girth exactly 3. %H A185063 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 A185063 a(n) = A165656(n) - A185264(n). %Y A185063 Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: A185033 (k=3), A185043 (k=4), A185053 (k=5), this sequence (k=6). %K A185063 nonn,more,hard %O A185063 0,17 %A A185063 _Jason Kimberley_, Mar 10 2012