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 A126889 #10 Oct 11 2017 21:57:53
%S A126889 1,2,2,6,2,2,6,2,2,6,2,4,4,2,2,3,4,2,4,2,2,4,2,6,6,2,4,4,2,2,4,4,2,6,
%T A126889 2,2,8,4,2,3,2,16,6,2,4,4,6,2,8,2,2,4,2,2,4,2,8,4,4,6,4,4,2,4,2,4,6,2,
%U A126889 2,6,4,4,4,2,2,4,4,2,4,4,2,4,2,4,4,2,6,4,2,2,4,4,11,4,2,2,4,2,2,4,4,4,4,4,2
%N A126889 a(n) = the number of divisors of A126888(n).
%C A126889 Is a(n) well-defined? Does every positive integer n equal floor(m/d(m)) for some m?
%H A126889 Michael De Vlieger, <a href="/A126889/b126889.txt">Table of n, a(n) for n = 1..10000</a>
%t A126889 f[n_] := Block[{k = 1, d}, While[d = Length[Divisors[k]]; Floor[k/d] != n, k++ ]; d]; Table[f[n], {n, 105}] (* _Ray Chandler_, Jan 04 2007 *)
%Y A126889 Cf. A126888.
%K A126889 nonn
%O A126889 1,2
%A A126889 _Leroy Quet_, Dec 30 2006
%E A126889 Extended by _Ray Chandler_, Jan 04 2007