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 A185315 #11 Feb 22 2013 10:46:16 %S A185315 1,1,2,1,2,2,3,2,3,2,5,3,7,4,15,6,57,8,466,12,5801,24,91091,3939, %T A185315 1744378,4132022,163639295,4018022192,119026596500 %N A185315 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 5. %H A185315 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 A185315 a(n) = A186725(n) + A185215(n). %Y A185315 Not necessarily connected k-regular simple graphs with girth at least 5: this sequence (any k), A185305 (triangle); specified degree k: A185325 (k=2), A185335 (k=3). %Y A185315 Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), this sequence (g=5), A185316 (g=6), A185317 (g=7), A185318 (g=8), A185319 (g=9). %K A185315 nonn,more,hard %O A185315 0,3 %A A185315 _Jason Kimberley_, Dec 12 2012