This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052434 Round[R[x]-PrimePi[x]], where R[x] is the Riemann prime number formula. 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. [From Harry J. Smith, Dec 31 2008] Eric Weisstein's World of Mathematics, Prime Counting Function EXAMPLE a(13) = 0 because R(13) = 5.504 and Pi(13) = 6 [From Harry J. Smith, Dec 31 2008] PROG (XPCalc) a=Round(Ri(n)-Pi(n)) [From Harry J. Smith, Dec 31 2008] CROSSREFS Cf. A052435. Sequence in context: A014057 A015689 A104124 * A015241 A014025 A156297 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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .