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.

A067460 a(n) = mu(prime(n)-1)+1.

Original entry on oeis.org

2, 0, 1, 2, 2, 1, 1, 1, 2, 1, 0, 1, 1, 0, 2, 1, 2, 1, 0, 0, 1, 0, 2, 1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 2, 1, 2, 1, 0, 1, 1, 1, 2, 0, 2, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 2, 1, 1, 2, 0, 1, 1, 2, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 2, 2, 2, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2
Offset: 1

Views

Author

Benoit Cloitre, Feb 23 2002

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := MoebiusMu[Prime[n]-1] + 1; Array[a, 100] (* Amiram Eldar, Apr 23 2025 *)
  • PARI
    a(n) = moebius(prime(n)-1) + 1; \\ Amiram Eldar, Apr 23 2025

Formula

a(n) = A089451(n)+1. - R. J. Mathar, Jul 21 2017