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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084235 Smallest k such that |M(k)| = 2^n, where M(x) is Mertens's function A002321. 0
1, 5, 31, 199, 1637, 8507, 24110, 95961, 355541, 1786062, 6473791, 30649362, 109851909, 456774199, 2589994747, 7613644886, 37725066313, 108500046711 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

Karl Sabbagh, The Riemann Hypothesis, The Greatest Unsolved Problem in Mathematics, Farrar, Straus and Giroux, New York, 2002, page 191.

LINKS

Table of n, a(n) for n=1..18.

MATHEMATICA

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

CROSSREFS

Cf. A051402, A084234.

Sequence in context: A108079 A164038 A260782 * A288688 A002469 A296032

Adjacent sequences:  A084232 A084233 A084234 * A084236 A084237 A084238

KEYWORD

nonn,more

AUTHOR

Robert G. Wilson v, May 13 2003

EXTENSIONS

Definition corrected by L. Edson Jeffery, Mar 18 2013

a(15)-a(18) by Ashley Jordan and Luke March, Jul 22 2014

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 08:23 EDT 2018. Contains 315270 sequences. (Running on oeis4.)