|
Search: id:A059111
|
|
|
| A059111 |
|
Floor(prime(n) - n*log(n)). |
|
+0
4
|
|
| 2, 1, 1, 1, 2, 2, 3, 2, 3, 5, 4, 7, 7, 6, 6, 8, 10, 8, 11, 11, 9, 10, 10, 12, 16, 16, 14, 13, 11, 10, 20, 20, 21, 19, 24, 21, 23, 24, 24, 25, 26, 24, 29, 26, 25, 22, 30, 37, 36, 33, 32, 33, 30, 35, 36, 37, 38, 35, 36, 35, 32, 37, 45, 44, 41, 40, 49, 50, 54, 51, 50, 51, 53, 54, 55
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
C. K. Caldwell, How Many Primes Are There?
|
|
PROGRAM
|
(PARI) { default(realprecision, 100); for (n = 1, 1000, write("b059111.txt", n, " ", floor(prime(n) - n*log(n))); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 25 2009]
|
|
CROSSREFS
|
Cf. A064658, A064659, A059112.
Sequence in context: A029386 A060502 A035439 this_sequence A103502 A127950 A069545
Adjacent sequences: A059108 A059109 A059110 this_sequence A059112 A059113 A059114
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jan 04 2001
|
|
EXTENSIONS
|
Definition corrected by Harry J. Smith, Jun 24 2009
|
|
|
Search completed in 0.002 seconds
|
