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 A185219 #10 Apr 05 2013 17:02:17 %S A185219 0,0,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,3,2,4,3,5,4,6,5,7,7,9,9,12,12,15, %T A185219 16,19,20,25,26,31,34,40,43,51,55,64,71,81,89,103,113,129,143,162,179, %U A185219 204,225,254,282,317,351,396,437,490,544,608,673,753,832,928,1028,1144,1264 %N A185219 Number of disconnected regular simple graphs on n vertices with girth at least 9. %H A185219 Jason Kimberley, <a href="/A185219/b185219.txt">Table of n, a(n) for n = 0..116</a> %H A185219 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> %e A185219 a(116) = 89574 because there is 1 such 0-regular graph (116 disconnected vertices), 1 such 1-regular graph (58 loose edges), A185229(116) = 89401, and 171 such 3-regular graphs (because A210709(58)=18). %Y A185219 Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), A185218 (g=8), this sequence (g=9). %K A185219 nonn,hard %O A185219 0,5 %A A185219 _Jason Kimberley_, Dec 19 2012