login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249904 a(n) = mu(n) + sigma(n) - n. 1

%I #30 Mar 02 2018 22:44:53

%S 1,0,0,3,0,7,0,7,4,9,0,16,0,11,10,15,0,21,0,22,12,15,0,36,6,17,13,28,

%T 0,41,0,31,16,21,14,55,0,23,18,50,0,53,0,40,33,27,0,76,8,43,22,46,0,

%U 66,18,64,24,33,0,108,0,35,41,63,20,77

%N a(n) = mu(n) + sigma(n) - n.

%C The 0 terms identify the prime numbers.

%H Antti Karttunen, <a href="/A249904/b249904.txt">Table of n, a(n) for n = 1..65537</a>

%F a(n) = A001065(n) + A008683(n). - _Antti Karttunen_, Feb 25 2018

%t Table[(MoebiusMu[k] + (DivisorSigma[1, k] - k)), {k, 200} ]

%o (PARI) vector(100, n, moebius(n) + sigma(n) - n) \\ _Michel Marcus_, Jan 31 2015

%Y Cf. A000203, A001065, A008683.

%Y Cf. A249767, A249901.

%K nonn

%O 1,4

%A _Ke Xiao_, Jan 13 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)