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 A185316 #8 Feb 22 2013 10:46:26 %S A185316 1,1,2,1,2,1,3,2,3,2,3,2,4,3,6,4,7,5,13,7,42,10,398,13,7592,18,181251, %T A185316 25,4624534,33,122090591,45,3328930034,61,93990693977,106 %N A185316 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 6. %H A185316 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 A185316 a(n) = A186726(n) + A185216(n). %Y A185316 Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), this sequence (g=6), A185317 (g=7), A185318 (g=8), A185319 (g=9). %K A185316 nonn,more,hard %O A185316 0,3 %A A185316 _Jason Kimberley_, Dec 12 2012