id:A071570 - OEIS Search Results

Search: id:A071570

Displaying 1-1 of 1 results found.

page 1

2*sum(d dividing n, 2^mu(d)).

+0
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; listen)

	OFFSET	`1,1`
	FORMULA	`Asymptotically : sum(k=1, n, a(k))=2C*nLog(n)+0(nLog(n)) with C=1, 1...`
	PROGRAM	`(PARI) for(n=1, 100, print1(2*sumdiv(n, d, 2^moebius(d)), ", "))`
	CROSSREFS	`Sequence in context: A120189 A028276 A110883 this_sequence A082448 A070783 A055593` `Adjacent sequences: A071567 A071568 A071569 this_sequence A071571 A071572 A071573`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2002`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research