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 A185153 #11 May 01 2014 02:37:07 %S A185153 0,0,0,1,3,59,7848,3459379,2585136353,2807104852102 %N A185153 Number of not necessarily connected 5-regular simple graphs on 2n vertices with girth exactly 3. %H A185153 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 A185153 a(n) = A165626(n) - A185354(n). %F A185153 a(n) = A184953(n) + A185053(n). %Y A185153 Not necessarily connected k-regular simple graphs girth exactly 3: A198313 (any k), A185643 (triangle); fixed k: A026796 (k=2), A185133 (k=3), A185143 (k=4), this sequence (k=5), A185163 (k=6). %K A185153 nonn,hard,more %O A185153 0,5 %A A185153 _Jason Kimberley_, Mar 12 2012