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!)
A073578 a(n) = Sum_{k=1..n} mu(2*k). 1

%I #15 Sep 06 2020 03:46:33

%S -1,-1,0,0,1,1,2,2,2,2,3,3,4,4,3,3,4,4,5,5,4,4,5,5,5,5,5,5,6,6,7,7,6,

%T 6,5,5,6,6,5,5,6,6,7,7,7,7,8,8,8,8,7,7,8,8,7,7,6,6,7,7,8,8,8,8,7,7,8,

%U 8,7,7,8,8,9,9,9,9,8,8,9,9,9,9,10,10,9,9,8,8,9,9,8,8,7,7,6,6,7,7,7,7,8,8,9,9

%N a(n) = Sum_{k=1..n} mu(2*k).

%C After a(2)=-1, the next negative value is a(8511)=-1.

%C Observation: It seems that Sum_{k=1..n} a(k) is usually close to n*log(n)*log(log(n)). Is Sum_{k=1..n} a(k) asymptotic to C*n*log(n)*log(log(n)) for some C near 1?

%H Amiram Eldar, <a href="/A073578/b073578.txt">Table of n, a(n) for n = 1..10000</a>

%t Accumulate[MoebiusMu[2Range[110]]] (* _Harvey P. Dale_, Apr 30 2012 *)

%Y Cf. A008683.

%K easy,sign

%O 1,7

%A _Benoit Cloitre_, Aug 28 2002

%E Edited by _Dean Hickerson_, Sep 04 2002

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 June 5 01:34 EDT 2024. Contains 373102 sequences. (Running on oeis4.)