login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053621 Nearest integer to n/(log(n)-1). 1
-1, -7, 30, 10, 8, 8, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

n/(log(n)-1) is a better approximation than n/log(n) to pi(n) the number of primes <= n, though worse than the logarithmic integral or the Riemann prime number formula

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

C. K. Caldwell, How Many Primes Are There?

PROG

(Haskell)

a053621 = round . (\x -> x / (log x - 1)) . fromIntegral

-- Reinhard Zumkeller, Apr 30 2014

CROSSREFS

Cf. A000720, A047784, A050499.

Sequence in context: A300528 A157422 A061644 * A210107 A266604 A018831

Adjacent sequences:  A053618 A053619 A053620 * A053622 A053623 A053624

KEYWORD

sign

AUTHOR

Henry Bottomley, Mar 21 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:00 EDT 2019. Contains 322406 sequences. (Running on oeis4.)