login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A053620
Nearest integer to R(n) = the Riemann prime number formula.
2
1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20
OFFSET
2,2
COMMENTS
This is a good approximation to pi(n), the number of prime numbers <= n.
LINKS
Eric Weisstein's World of Mathematics, Riemann Prime Counting Function.
CROSSREFS
KEYWORD
nonn
AUTHOR
Henry Bottomley, Mar 21 2000
STATUS
approved