|
| |
|
|
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; 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 (hjsmithh(AT)sbcglobal.net), 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 (hjsmithh(AT)sbcglobal.net), Dec 31 2008]
|
|
|
PROG
| (XPCalc) a=Round(Ri(n)-Pi(n)) [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), 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
| Eric Weisstein (eric(AT)weisstein.com)
|
|
|
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 (hjsmithh(AT)sbcglobal.net), Dec 31 2008
|
| |
|
|
