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 A085581 #7 Aug 17 2017 05:58:07
%S A085581 4,4,5,6,7,8,9,10,12,12,14,15,16,17,19,20,21,22,23,23,25,26,28,30,30,
%T A085581 31,32,32,33,36,37,39,39,41,42,43,44,45,46,48,48,50,51,51,51,54,57,58,
%U A085581 58,59,60,60,62,64,65,66,66,67,68,68,70,74,74,74,75,78,79,81,82,82,83,85
%N A085581 a(n) = floor( prime(n)/log(n) ).
%C A085581 Related to the prime number theorem, prime(k) ~ k * log(k).
%D A085581 G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Oxford University Press, 1979.
%H A085581 Chris K. Caldwell, <a href="http://www.utm.edu/research/primes/howmany.shtml">How Many Primes Are There?</a>
%t A085581 Table[Floor[Prime[k]/Log[k + 1]], {k, 1, 1000}]
%K A085581 easy,nonn
%O A085581 2,1
%A A085581 _Carlos Alves_, Jul 06 2003