login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071570 a(n) = 2*sum(d dividing n, 2^mu(d)). 1
4, 5, 5, 7, 5, 10, 5, 9, 7, 10, 5, 14, 5, 10, 10, 11, 5, 14, 5, 14, 10, 10, 5, 18, 7, 10, 9, 14, 5, 20, 5, 13, 10, 10, 10, 20, 5, 10, 10, 18, 5, 20, 5, 14, 14, 10, 5, 22, 7, 14, 10, 14, 5, 18, 10, 18, 10, 10, 5, 28, 5, 10, 14, 15, 10, 20, 5, 14, 10, 20, 5, 26, 5, 10, 14, 14, 10, 20, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

FORMULA

Asymptotically: sum(k=1, n, a(k)) = 2C*n*log(n)+0(n*log(n)) with C=1.1...

PROG

(PARI) for(n=1, 100, print1(2*sumdiv(n, d, 2^moebius(d)), ", "))

CROSSREFS

Sequence in context: A316150 A110883 A178131 * A082448 A190796 A070783

Adjacent sequences:  A071567 A071568 A071569 * A071571 A071572 A071573

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, May 31 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 18:13 EST 2020. Contains 331051 sequences. (Running on oeis4.)