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 A210718 #8 Aug 11 2014 22:45:48 %S A210718 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,7,7, %T A210718 9,10,12,13,16,17,21,23,27,30,36,39,46,51,60,66,77,85,99,110,126,140, %U A210718 162,179,205,228,261,289,329,365,416,461,524,579,669,726,976,909,5378,1134 %N A210718 Number of disconnected regular simple graphs on n vertices with girth exactly 8. %H A210718 Jason Kimberley, <a href="/A210718/b210718.txt">Table of n, a(n) for n = 0..77</a> %H A210718 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 A210718 a(n) = A185218(n) - A185219(n). %K A210718 nonn,hard %O A210718 0,25 %A A210718 _Jason Kimberley_, Dec 19 2012