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 A185218 #7 Dec 17 2012 13:13:39 %S A185218 0,0,1,1,2,1,2,1,2,1,2,1,2,1,2,1,3,2,4,3,5,4,6,5,8,7,10,10,13,13,17, %T A185218 17,22,23,28,30,37,39,47,51,61,66,78,85,100,110,127,140,163,179,206, %U A185218 228,261,289,330,365,416,461,522,579,657,726,819,909,1024,1134,1277,1411 %N A185218 Number of disconnected regular simple graphs on n vertices with girth at least 8. %H A185218 Jason Kimberley, <a href="/A185218/b185218.txt">Table of n, a(n) for n = 0..77</a> %H A185218 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a> %Y A185218 Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), this sequence (g=8). %K A185218 nonn,hard %O A185218 0,5 %A A185218 _Jason Kimberley_, Dec 14 2012