Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063473
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063473 M(2*n-1), where M(n) is Mertens' function (A002321): Sum_{1<=k<=n} mu(k), where mu = Moebius function (A008683). +0
1
1, -1, -2, -2, -2, -2, -3, -1, -2, -3, -2, -2, -2, -1, -2, -4, -3, -1, -2, 0, -1, -3, -3, -3, -3, -2, -3, -2, -1, -1, -2, -1, 0, -2, -1, -3, -4, -3, -2, -4, -4, -4, -3, -1, -2, -1, 0, 2, 1, 1, 0, -2, -3, -3, -4, -4, -5, -5, -5, -3, -3, -1, -1, -2, -1, -3, -2, -1, -2, -4, -3, -1, 0, 1, 0, -1, -1, -1, -2, 0, 1, 0, -1, -1, -1, -2, -3, -4, -3 (list; graph; listen)
OFFSET

1,3

PROGRAM

(PARI) M(n)=sum(k=1, n, moebius(k)); j=[]; for(n=1, 200, j=concat(j, M(2*n-1))); j

CROSSREFS

Cf. A002321, A008683.

Sequence in context: A057331 A067089 A090872 this_sequence A096859 A005086 A020649

Adjacent sequences: A063470 A063471 A063472 this_sequence A063474 A063475 A063476

KEYWORD

easy,sign

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 27 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research