The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A100198 Let f(0) = -1, f(n) = Moebius(n) = A008683(n) for n>0. Sequence gives partial sums a(n) = Sum_{ 0 <= i <= n} f(i). 1

%I #5 Jan 21 2019 19:01:55

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

%T -3,-3,-3,-2,-2,-2,-3,-4,-5,-5,-4,-3,-2,-2,-3,-2,-1,-1,-2,-3,-4,-4,-4,

%U -3,-4,-4,-4,-4,-3,-3,-4,-4,-3,-3,-2,-1,-2,-2,-3,-2,-2,-2,-1,-2,-3,-3,-2,-3,-4,-4,-5,-4,-4,-4,-3,-4,-5,-5,-5,-4,-5,-5,-4,-3,-2,-2,-3,-3,-2,-2,-1,0,1,1,0,0,0,0,-1,-2,-3,-3

%N Let f(0) = -1, f(n) = Moebius(n) = A008683(n) for n>0. Sequence gives partial sums a(n) = Sum_{ 0 <= i <= n} f(i).

%p seq(abs(sum(mobius(x),x=0..a)),a=0..100);

%t Accumulate[Join[{-1},MoebiusMu[Range[110]]]] (* _Harvey P. Dale_, Jun 20 2017 *)

%Y See A002321 for a better version.

%K sign

%O 0,4

%A _Jorge Coveiro_, Dec 27 2004

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 May 20 23:58 EDT 2024. Contains 372720 sequences. (Running on oeis4.)