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”).

A089495
a(n) = mu(prime(n)+1), where mu is the Moebius function.
4
-1, 0, 1, 0, 0, 1, 0, 0, 0, -1, 0, 1, -1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, -1, 0, 0, -1, -1, 0, 0, -1, 0, 0, 0, 1, 0, 0, -1, 0, -1, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 1, 1, -1, -1, 0, 1, 0, -1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 1, -1, 0, 0, -1, 0, 0
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Moebius Function
MATHEMATICA
Table[MoebiusMu[Prime[n]+1], {n, 150}]
CROSSREFS
Cf. A049098 (primes p such that mu(p+1) = 0), A078329 (primes p such that mu(p+1) = -1), A089523 (primes p such that mu(p+1) = 1), A089451 (mu(p-1) for prime p), A089496 (mu(p+1)+mu(p-1) for prime p), A089497 (mu(p+1)-mu(p-1) for prime p).
A067461(n) - 1.
Sequence in context: A320841 A351725 A243148 * A345703 A365807 A173857
KEYWORD
sign
AUTHOR
T. D. Noe, Nov 04 2003
STATUS
approved