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 A185317 #8 Feb 22 2013 10:46:40 %S A185317 1,1,2,1,2,1,2,2,3,2,3,2,3,2,4,3,5,4,6,5,7,7,9,9,13,12,18,16,41,21, %T A185317 572,28,30402,37,1782884,49,95079141,64,4686063195,84 %N A185317 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 7. %H A185317 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 A185317 a(n) = A186727(n) + A185217(n). %Y A185317 Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), A185316 (g=6), this sequence (g=7), A185318 (g=8), A185319 (g=9). %K A185317 nonn,more,hard %O A185317 0,3 %A A185317 _Jason Kimberley_, Dec 12 2012