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 A050501 #19 Jan 17 2017 04:23:16
%S A050501 3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,7,8,8,8,8,8,9,9,9,9,10,10,10,
%T A050501 10,10,11,11,11,11,11,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14,
%U A050501 15,15,15,15,15,16,16,16,16,16,16,17,17,17,17,17,18,18
%N A050501 a(n) = ceiling(n/log(n)).
%C A050501 Also, least k such that k*log(n) exceeds n. - _Amarnath Murthy_, Jun 17 2004
%H A050501 T. D. Noe, <a href="/A050501/b050501.txt">Table of n, a(n) for n = 2..10000</a>
%t A050501 Do[k = 1; While[k*Log[n] <= n, k++ ]; Print[k], {n, 2, 100}] (* _Ryan Propper_, Sep 17 2005 *)
%t A050501 Array[ Ceiling[#/Log@#] &, 80, 2] (* _Robert G. Wilson v_, Jan 15 2017 *)
%Y A050501 See A050499 for more information.
%K A050501 nonn
%O A050501 2,1
%A A050501 _N. J. A. Sloane_, Dec 27 1999
%E A050501 Edited by _N. J. A. Sloane_, Sep 15 2008 at the suggestion of _R. J. Mathar_