id:A073578 - OEIS Search Results

Search: id:A073578

Displaying 1-1 of 1 results found.

page 1

Sum(k=1,n,mu(2*k)).

+0
1

-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, 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, 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 (list; graph; listen)

	OFFSET	`1,7`
	COMMENT	`After a(2)=-1, the next negative value is a(8511)=-1.` `Observation: It seems that sum(k=1,n,a(k)) is usually close to nlog(n)log(log(n)). Is sum(k=1,n,a(k)) asymptotic to Cnlog(n)*log(log(n)) for some C near 1?`
	CROSSREFS	`Sequence in context: A106161 A105588 A064658 this_sequence A087866 A061392 A048273` `Adjacent sequences: A073575 A073576 A073577 this_sequence A073579 A073580 A073581`
	KEYWORD	`easy,sign`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 28 2002`
	EXTENSIONS	`Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Sep 04 2002`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research