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 A050499 #27 Jan 25 2025 04:48:20
%S A050499 3,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,6,7,7,7,7,8,8,8,8,8,9,9,9,9,9,10,
%T A050499 10,10,10,10,11,11,11,11,11,12,12,12,12,12,13,13,13,13,13,14,14,14,14,
%U A050499 14,14,15,15,15,15,15,16,16,16,16,16,16,17,17,17,17
%N A050499 Nearest integer to n/log(n).
%C A050499 The prime number theorem states that the number of primes <= x is asymptotic to x/log(x).
%C A050499 n/log(n) = n*A002285/log_10(n). [_Eric Desbiaux_, Jun 27 2009]
%C A050499 Similar to floor(1/(1-x)) where x^n=1/n. - _Jon Perry_, Oct 29 2013
%D A050499 Cf. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, Theorem 6.
%H A050499 T. D. Noe, <a href="/A050499/b050499.txt">Table of n, a(n) for n=2..10000</a>
%t A050499 Table[Round[n/Log[n]],{n,2,80}] (* _Harvey P. Dale_, Nov 03 2013 *)
%o A050499 (JavaScript)
%o A050499 for (i=1;i<100;i++) {
%o A050499 x=Math.pow(1/i,1/i);
%o A050499 document.write(Math.floor(1/(1-x))+", ");
%o A050499 }
%o A050499 (PARI) a(n) = round(n/log(n)); \\ _Michel Marcus_, Jan 24 2025
%Y A050499 Cf. A000720, A050500, A050501.
%K A050499 nonn
%O A050499 2,1
%A A050499 _N. J. A. Sloane_, Dec 27 1999