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 A111291 #7 Jan 10 2013 07:15:51
%S A111291 1,4,16,92,665,5257,44705,394240,3558181,32608999,302172507,2823898245
%N A111291 Number of refactorable numbers (A033950) <= 10^n.
%C A111291 Simon Colton conjectures that the number of refactorables less than x is at least x/(2 log(x)).
%H A111291 S. Colton, <a href="http://www.cs.uwaterloo.ca/journals/JIS/colton/joisol.html">Refactorable Numbers - A Machine Invention</a>, J. Integer Sequences, Vol. 2, 1999, #2.
%t A111291 c = 0; k = 1; Do[ While[k <= 10^n, If[ Mod[k, DivisorSigma[0, k]] == 0, c++ ]; k++ ]; Print[c], {n, 0, 8}]
%Y A111291 Cf. A033950.
%K A111291 more,nonn
%O A111291 0,2
%A A111291 _Robert G. Wilson v_, Nov 01 2005
%E A111291 a(9)-a(11) from _Donovan Johnson_, Sep 19 2009