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.

A099990 a(n) = Moebius(2n+1).

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Nov 20 2004

Keywords

Crossrefs

Bisection of A008683.
Cf. A099991.

Programs

  • Mathematica
    a[n_] := MoebiusMu[2*n + 1]; Array[a, 100, 0] (* Amiram Eldar, Jul 23 2023 *)
  • PARI
    a(n) = moebius(2*n+1); \\ Michel Marcus, Aug 12 2021