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 A185264 #12 May 01 2014 02:37:03 %S A185264 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,10,7,277, %T A185264 3742,483330,69827771,14836620025 %N A185264 Number of disconnected 6-regular simple graphs on n vertices with girth at least 4. %H A185264 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 A185264 a(n) %F A185264 = A185364(n) - A058276(n) %F A185264 = Euler_transformation(A058276)(n) - A058276(n). %Y A185264 6-regular simple graphs with girth at least 4: A058276 (connected), this sequence (disconnected), A185364 (not necessarily connected). %Y A185264 Disconnected k-regular simple graphs with girth at least 4: A185214 (any k), A185204 (triangle); specified degree k: A185224 (k=2), A185234 (k=3), A185244 (k=4), A185254 (k=5), this sequence (k=6), A185274 (k=7), A185284 (k=8), A185294 (k=9). %K A185264 nonn,more,hard %O A185264 0,29 %A A185264 _Jason Kimberley_, Feb 22 2011