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!)
A062563 a(n) = Sum_{k=1..n} d(k)* mu(k), where d(k) is the number of divisors function. 1

%I #18 Jun 25 2022 00:50:11

%S 1,-1,-3,-3,-5,-1,-3,-3,-3,1,-1,-1,-3,1,5,5,3,3,1,1,5,9,7,7,7,11,11,

%T 11,9,1,-1,-1,3,7,11,11,9,13,17,17,15,7,5,5,5,9,7,7,7,7,11,11,9,9,13,

%U 13,17,21,19,19,17,21,21,21,25,17,15,15,19,11,9,9,7,11,11,11,15,7,5,5,5,9,7,7,11,15,19,19,17,17,21,21,25,29,33,33,31

%N a(n) = Sum_{k=1..n} d(k)* mu(k), where d(k) is the number of divisors function.

%F Also a(n) = Sum_{k=1..n} 2^omega(k)*mu(k). - _Benoit Cloitre_, Jun 13 2007

%t Accumulate[Table[DivisorSigma[0,n]MoebiusMu[n],{n,100}]] (* _Harvey P. Dale_, Aug 15 2016 *)

%o (PARI) v=[]; for(n=1,250,v=concat(v,sum(k=1,n,numdiv(k)*moebius(k)))); v

%Y Partial sums of A226177.

%K sign

%O 1,3

%A _Jason Earls_, Jul 03 2001

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 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)