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 A185033 #14 May 01 2014 02:37:01 %S A185033 0,0,0,0,1,2,8,29,138,774,5678,53324,622716,8604351,135344959, %T A185033 2363662004,45134533117,933058713014,20735549517852,492653820710746 %N A185033 Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 3. %H A185033 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_eq_g_index">Index of sequences counting disconnected k-regular simple graphs with girth exactly g</a> %F A185033 a(n) = A165653(n) - A185234(n). %Y A185033 Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: this sequence (k=3), A185043 (k=4), A185053 (k=5), A185063 (k=6). %Y A185033 Disconnected 3-regular simple graphs with girth exactly g: this sequence (g=3), A185034 (g=4), A185035 (g=5), A185036 (g=6), A185037 (g=7). %K A185033 nonn,more,hard %O A185033 0,6 %A A185033 _Jason Kimberley_, Feb 29 2012