A085581 a(n) = floor( prime(n)/log(n) ).

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, 31, 32, 32, 33, 36, 37, 39, 39, 41, 42, 43, 44, 45, 46, 48, 48, 50, 51, 51, 51, 54, 57, 58, 58, 59, 60, 60, 62, 64, 65, 66, 66, 67, 68, 68, 70, 74, 74, 74, 75, 78, 79, 81, 82, 82, 83, 85

Offset

2,1

Comments

Related to the prime number theorem, prime(k) ~ k * log(k).

References

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Oxford University Press, 1979.

Links

Table of n, a(n) for n=2..73.

Chris K. Caldwell, How Many Primes Are There?

Mathematica

Table[Floor[Prime[k]/Log[k + 1]], {k, 1, 1000}]

Crossrefs

Sequence in context: A368552 A120197 A243427 * A137902 A019527 A062836

Adjacent sequences: A085578 A085579 A085580 * A085582 A085583 A085584

Keyword

easy,nonn

Author

Carlos Alves, Jul 06 2003

Status

approved