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.

This page as a plain text file.
%I A067460 #13 Apr 24 2025 02:14:38
%S A067460 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,
%T A067460 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,
%U A067460 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
%N A067460 a(n) = mu(prime(n)-1)+1.
%H A067460 Amiram Eldar, <a href="/A067460/b067460.txt">Table of n, a(n) for n = 1..10000</a>
%F A067460 a(n) = A089451(n)+1. - _R. J. Mathar_, Jul 21 2017
%t A067460 a[n_] := MoebiusMu[Prime[n]-1] + 1; Array[a, 100] (* _Amiram Eldar_, Apr 23 2025 *)
%o A067460 (PARI) a(n) = moebius(prime(n)-1) + 1; \\ _Amiram Eldar_, Apr 23 2025
%Y A067460 Cf. A008683, A089451.
%K A067460 easy,nonn
%O A067460 1,1
%A A067460 _Benoit Cloitre_, Feb 23 2002