Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084236
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084236 a(n) = M(2^n), where M(n) is Mertens's function. +0
1
1, 0, -1, -2, -1, -4, -1, -2, -1, -4, -4, 7, -19, 22, -32, 26, 14, -20, 24, -125, 257, -362, 228, -10, 211, -1042, 329, 330, -1703, 6222, -10374 (list; graph; listen)
OFFSET

0,4

FORMULA

Mertens's function: Sum_{1<=k<=n} mu(k), where mu = Moebius function (A008683).

MATHEMATICA

s = 0; i = 1; Do[ While[i <= 2^n, s = s + MoebiusMu[i]; i++ ]; Print[s], {n, 0, 50}]

CROSSREFS

Cf. A002321.

Sequence in context: A057550 A059150 A133186 this_sequence A068057 A003484 A006519

Adjacent sequences: A084233 A084234 A084235 this_sequence A084237 A084238 A084239

KEYWORD

more,sign

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), May 15 2003

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research