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 A185319 #7 Feb 22 2013 10:47:19 %S A185319 1,1,2,1,2,1,2,1,2,2,3,2,3,2,3,2,3,2,4,3,5,4,6,5,7,6,8,8,10,10,13,13, %T A185319 16,17,20,21,26,27,32,35,41,44,52,56,65,72,82,90,104,114,130,144,163, %U A185319 180,205,226,255,283,336 %N A185319 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 9. %H A185319 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 A185319 a(n) = A186729(n) + A185219(n). %Y A185319 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), A185318 (g=8), this sequence (g=9). %K A185319 nonn,more,hard %O A185319 0,3 %A A185319 _Jason Kimberley_, Dec 19 2012