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 A185318 #7 Feb 22 2013 10:46:50 %S A185318 1,1,2,1,2,1,2,1,3,2,3,2,3,2,3,2,4,3,5,4,6,5,7,6,9,8,11,11,14,14,19, %T A185318 18,23,24,30,31,41,40,61,52,217,67,4416,86,266463,111,20807816,141 %N A185318 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 8. %H A185318 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_ge_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth at least g</a> %F A185318 a(n) = A186728(n) + A185218(n). %Y A185318 Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), A185316 (g=6), A185317 (g=7), this sequence (g=8), A185319 (g=9). %K A185318 nonn,more,hard %O A185318 0,3 %A A185318 _Jason Kimberley_, Dec 18 2012