This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052434 Nearest integer to R(n) - pi(n), where R(x) is the Riemann prime counting function. 5
 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, -1, -1, -1, 0, 0, 0, -1, 0, 0, 0, -1, -1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Harry J. Smith, Table of n, a(n) for n = 2..10000 H. J. Smith, XPCalc - Extra Precision Floating-Point Calculator. Eric Weisstein's World of Mathematics, Riemann Prime Counting Function EXAMPLE a(13) = 0 because R(13) = 5.504 and pi(13) = 6. PROG (XPCalc) a=Round(Ri(n)-Pi(n)) - Harry J. Smith, Dec 31 2008 CROSSREFS Cf. A052435. Sequence in context: A014057 A015689 A104124 * A015241 A253513 A014025 Adjacent sequences:  A052431 A052432 A052433 * A052435 A052436 A052437 KEYWORD sign AUTHOR EXTENSIONS Corrected 6 terms, a(2), a(7), a(10), a(13), a(20) and a(48). Each was made 1 larger. Also gave an example for a(13) and a program for computing a(n). - Harry J. Smith, Dec 31 2008 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.

Last modified August 25 21:00 EDT 2019. Contains 326324 sequences. (Running on oeis4.)