cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A089495 a(n) = mu(prime(n)+1), where mu is the Moebius function.

Original entry on oeis.org

-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

Views

Author

T. D. Noe, Nov 04 2003

Keywords

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.

Programs

  • Mathematica
    Table[MoebiusMu[Prime[n]+1], {n, 150}]
Showing 1-1 of 1 results.