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 A185163 #10 May 01 2014 02:37:07 %S A185163 0,0,0,0,0,0,0,1,1,4,21,266,7848,367860,21609300,1470293675, %T A185163 113314233804,9799685588955 %N A185163 Number of not necessarily connected 6-regular simple graphs on n vertices with girth exactly 3. %H A185163 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 A185163 a(n) = A165627(n) - A185364(n). %F A185163 a(n) = A184953(n) + A185053(n). %Y A185163 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), A185153 (k=5), this sequence (k=6). %K A185163 nonn,hard,more %O A185163 0,10 %A A185163 _Jason Kimberley_, Mar 21 2012