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.

A099991 a(n) = Moebius(2n).

Original entry on oeis.org

-1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1
Offset: 1

Views

Author

N. J. A. Sloane, Nov 20 2004

Keywords

Comments

b(n) = -a(n) is multiplicative with b(2^e) = 0, b(p) = -1 if p >= 3, 0 otherwise. - David W. Wilson, Jun 12 2005

Crossrefs

Bisection of A008683. Cf. A099990.

Programs

Formula

a(n) = A008683(2n). - Wesley Ivan Hurt, Dec 17 2013