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 A185136 #9 May 01 2014 02:37:07 %S A185136 0,0,0,0,0,0,0,1,1,5,32,385,7573,181224,4624481,122089999,3328899592, %T A185136 93988909792 %N A185136 Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 6. %H A185136 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 A185136 a(n) = A006926(n) + A185036(n). %Y A185136 Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), A185135 (g=5), this sequence (g=6). %K A185136 nonn,hard,more %O A185136 0,10 %A A185136 _Jason Kimberley_, Mar 21 2012