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 A185216 #11 Nov 05 2012 07:28:18 %S A185216 0,0,1,1,2,1,2,1,2,1,2,1,3,2,4,3,5,4,7,6,9,9,12,12,17,17,22,24,31,32, %T A185216 42,44,60,60,109,80,529,107,8246,143,191422,188,4856141,248,127938143, %U A185216 326,3482858640,424,98176518751,552 %N A185216 Number of disconnected regular simple graphs on n vertices with girth at least 6. %H A185216 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_girth_ge_6">Disconnected regular graphs with girth at least 6</a> %H A185216 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 A185216 Disconnected k-regular simple graphs with girth at least 6: this sequence (all k), A185206 (triangle); A185226 (k=2), A185236 (k=3), A185246 (k=4). %Y A185216 Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), this sequence (g=6), A185217 (g=7). %K A185216 nonn,hard %O A185216 0,5 %A A185216 _Jason Kimberley_, Jun 21 2012