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 A185246 #18 May 01 2014 02:37:02 %S A185246 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, %T A185246 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,5,0,23,0,1301,25,495379, %U A185246 13529 %N A185246 Number of disconnected 4-regular simple graphs on n vertices with girth at least 6. %H A185246 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_girth_ge_6">Disconnected regular graphs with girth at least 6</a> %H A185246 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> %F A185246 a(n) = A185346(n) - A058348(n) = Euler_transformation(A058348)(n) - A058348(n). %Y A185246 4-regular simple graphs with girth at least 4: A058348 (connected), this sequence (disconnected), A185346 (not necessarily connected). %Y A185246 Disconnected 4-regular simple graphs with girth at least g: A033483 (g=3), A185244 (g=4), A185245 (g=5), this sequence (g=6). %Y A185246 Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), A185206 (triangle); A185226 (k=2), A185236 (k=3), this sequence (k=4). %K A185246 nonn,more,hard %O A185246 0,57 %A A185246 _Jason Kimberley_, Feb 22 2011