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 A185135 #9 May 01 2014 02:37:07 %S A185135 0,0,0,0,0,1,2,8,48,450,5752,90555,1612917,31297424,652159986, %T A185135 14499787794,342646826428 %N A185135 Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 5. %H A185135 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_eq_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g</a> %F A185135 a(n) = A185335(n) - A185336(n). %F A185135 a(n) = A006925(n) + A185035(n). %Y A185135 Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), this sequence (g=5), A185136 (g=6). %K A185135 nonn,hard,more %O A185135 0,7 %A A185135 _Jason Kimberley_, Mar 21 2012