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 A185134 #12 May 01 2014 02:37:07 %S A185134 0,0,0,1,2,5,21,103,752,7385,91939,1345933,22170664,401399440, %T A185134 7887389438,166897766824,3781593764772 %N A185134 Number of, not necessarily connected, 3-regular simple graphs on 2n vertices with girth exactly 4. %H A185134 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 A185134 a(n) = A185334(n) - A185335(n). %F A185134 a(n) = A006924(n) + A185034(n). %Y A185134 Not necessarily connected k-regular simple graphs girth exactly 4: A198314 (any k), A185644 (triangle); fixed k: A026797 (k=2), this sequence (k=3), A185144 (k=4). %Y A185134 Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), this sequence (g=4), A185135 (g=5), A185136 (g=6). %K A185134 nonn,hard,more %O A185134 0,5 %A A185134 _Jason Kimberley_, Mar 21 2012