|
%I #11 Feb 04 2022 23:11:25
%S 3,1,1,2,1,3,1,2,2,3,1,2,1,3,3,2,1,2,1,2,3,3,1,2,2,3,2,2,1,1,1,2,3,3,
%T 3,2,1,3,3,2,1,1,1,2,2,3,1,2,2,2,3,2,1,2,3,2,3,3,1,2,1,3,2,2,3,1,1,2,
%U 3,1,1,2,1,3,2,2,3,1,1,2,2,3,1,2,3,3,3,2,1,2,3,2,3,3,3,2,1,2,2,2,1,1,1,2,1
%N a(n) = mu(n)+2, where mu is the Moebius function (A008683).
%C 1 <= a(n) <= 3.
%H Antti Karttunen, <a href="/A080847/b080847.txt">Table of n, a(n) for n = 1..5000</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%t MoebiusMu[Range[120]]+2 (* _Harvey P. Dale_, Dec 31 2021 *)
%o (define (A080847 n) (+ 2 (A008683 n))) ;; _Antti Karttunen_, Jul 26 2017
%Y Cf. A008683, one more than A007423, one less than A231821.
%Y Cf. A080848, A080849.
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, Feb 20 2003
|
