login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = mu(n) + bigomega(n).
4

%I #36 Sep 08 2022 08:46:10

%S 1,0,0,2,0,3,0,3,2,3,0,3,0,3,3,4,0,3,0,3,3,3,0,4,2,3,3,3,0,2,0,5,3,3,

%T 3,4,0,3,3,4,0,2,0,3,3,3,0,5,2,3,3,3,0,4,3,4,3,3,0,4,0,3,3,6,3,2,0,3,

%U 3,2,0,5,0,3,3,3,3,2

%N a(n) = mu(n) + bigomega(n).

%C The 0 terms identify for the prime numbers.

%H Antti Karttunen, <a href="/A249901/b249901.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>

%F a(n) = A008683(n) + A001222(n).

%p with(numtheory): a := n -> mobius(n) + bigomega(n):

%p seq(a(n), n = 1..78); # _Peter Luschny_, Jul 08 2017

%t Table[MoebiusMu[k] + PrimeOmega[k], {k, 200}]

%o (PARI) A249901(n) = (moebius(n) + bigomega(n)); \\ _Antti Karttunen_, Jul 08 2017

%o (Magma) [n eq 1 select 1 else &+[p[2]: p in Factorization(n)]+ MoebiusMu(n): n in [1..120]]; // _Vincenzo Librandi_, Jul 09 2017

%Y Cf. A001222, A008683, A249767.

%K nonn

%O 1,4

%A _Ke Xiao_, Jan 13 2015