|
| |
|
|
A073578
|
|
Sum(k=1,n,mu(2*k)).
|
|
0
| |
|
|
-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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,7
|
|
|
COMMENTS
| 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 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?
|
|
|
CROSSREFS
| Sequence in context: A105588 A064658 A194292 * A087866 A061392 A048273
Adjacent sequences: A073575 A073576 A073577 * 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
|
| |
|
|
