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
-1, 0, -1, -2, -2, -3, -2, -3, -3, -3, -2, -3, -3, -4, -3, -2, -2, -3, -3, -4, -4, -3, -2, -3, -3, -3, -2, -2, -2, -3, -4, -5, -5, -4, -3, -2, -2, -3, -2, -1, -1, -2, -3, -4, -4, -4, -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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
MAPLE
seq(abs(sum(mobius(x), x=0..a)), a=0..100);
MATHEMATICA
Accumulate[Join[{-1}, MoebiusMu[Range[110]]]] (* Harvey P. Dale, Jun 20 2017 *)
CROSSREFS
See A002321 for a better version.
Sequence in context: A107573 A081308 A070210 * A164996 A216195 A304333
KEYWORD
sign
AUTHOR
Jorge Coveiro, Dec 27 2004
STATUS
approved

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 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)