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 A185217 #10 Oct 28 2012 10:22:09 %S A185217 0,0,1,1,2,1,2,1,2,1,2,1,2,1,3,2,4,3,5,4,6,6,8,8,11,11,14,15,19,20,25, %T A185217 27,33,36,43,48,57,63,74,83,97,108,126,141,163,183,210,236,272,304, %U A185217 350,390,471,498,1175,635,32957,807,1886322,1022,101215816,1291,5025322391 %N A185217 Number of disconnected regular simple graphs on n vertices with girth at least 7. %H A185217 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 A185217 Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), this sequence (g=7). %Y A185217 Disconnected k-regular simple graphs with girth at least 7: this sequence (all k), A185207 (triangle); A185227 (k=2), A185237 (k=3). %K A185217 nonn,hard %O A185217 0,5 %A A185217 _Jason Kimberley_, Oct 27 2012