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 A038605 #9 Mar 16 2017 15:49:54 %S A038605 2,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4, %T A038605 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, %U A038605 5,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5 %N A038605 a(n) = floor( prime(n)/n ). %H A038605 Robert Israel, <a href="/A038605/b038605.txt">Table of n, a(n) for n = 1..10000</a> %F A038605 The prime number theorem is equivalent to the statement a(n) ~ log n. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001 %p A038605 seq(floor(ithprime(n)/n), n=1..200); # _Robert Israel_, Mar 16 2017 %Y A038605 Cf. A000040. %K A038605 nonn %O A038605 1,1 %A A038605 Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul %E A038605 Corrected by _David Wasserman_, Feb 23 2006