login
A079627
Sum(mu(m) : prime(n) < m < prime(n+1)), where mu is the Moebius function (A008683).
0
0, 0, 1, 1, 0, 2, 0, 2, 1, -1, 3, 2, -1, 1, 1, 3, 0, 1, 0, 0, 1, 1, 3, 4, 0, -1, 0, 0, 0, 4, 0, 2, -1, 5, 0, 0, 3, 0, -1, 1, 0, 0, 0, 0, 0, 7, 6, 1, 0, -2, 1, 0, 1, 1, 1, 1, 0, 0, 1, -1, -1, 7, 0, 0, 1, 5, 2, 2, 0, 0, 0, 1, 0, 0, 2, 0, 5, 0, 0, 2, 0, -1, 0, -2, -1, 3, 2, 1, 1, 0, 2, 2, 1, 0, 2, 0, 5, 0, 4, 4, 2, 1, 2, 1, 0, 3
OFFSET
1,6
COMMENTS
a(n) = A002321(A000040(n+1)-1) - A002321(A000040(n)).
EXAMPLE
n=16: adding mu(m) for A000040(16)=53 < m < A000040(17)=59: a(16) = mu(54)+mu(55)+mu(56)+mu(57)+mu(58) = mu(2*3^3)+mu(5*11)+mu(7*2^3)+mu(3*19)+mu(2*29) = 0+(-1)*(-1)+0+(-1)*(-1)+(-1)*(-1) = 1+1+1 = 3.
CROSSREFS
Sequence in context: A320042 A055651 A175929 * A061398 A080232 A008482
KEYWORD
sign
AUTHOR
Reinhard Zumkeller, Jan 30 2003
STATUS
approved