login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084236 a(n) = M(2^n), where M(n) is Mertens's function. 0
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, 9569, 1814, -10339, -3421, 8435, 38176, -28118, 38729, -135944, 101597, 15295, -169338, 259886, -474483, 1726370, -3554573 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..46.

Greg Hurst, Computations of the Mertens function and improved bounds on the Mertens conjecture, arXiv:1610.08551 [math.NT] (2016).

FORMULA

Mertens's function: M(2^n) = Sum_{1<=k<=2^n} mu(k), where mu = Moebius function (A008683). - corrected by Indranil Ghosh, Mar 15 2017

MATHEMATICA

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

PROG

(PARI) for(n=0, 30, print1(sum(k=1, 2^n, moebius(k)), ", ")) \\ Indranil Ghosh, Mar 15 2017

CROSSREFS

Cf. A002321.

Sequence in context: A324892 A059150 A133186 * A068057 A003484 A118827

Adjacent sequences:  A084233 A084234 A084235 * A084237 A084238 A084239

KEYWORD

more,sign

AUTHOR

Robert G. Wilson v, May 15 2003

EXTENSIONS

a(31)-a(46) from Hurst's paper (copied by Charles R Greathouse IV, Oct 15 2018)

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:31 EDT 2019. Contains 322461 sequences. (Running on oeis4.)