A084235 Smallest k such that |M(k)| = 2^n, where M(x) is Mertens's function A002321.
1, 5, 31, 199, 1637, 8507, 24110, 95961, 355541, 1786062, 6473791, 30649362, 109851909, 456774199, 2589994747, 7613644886, 37725066313, 108500046711
Offset: 1
References
- Karl Sabbagh, The Riemann Hypothesis, The Greatest Unsolved Problem in Mathematics, Farrar, Straus and Giroux, New York, 2002, page 191.
Programs
-
Mathematica
i = s = 0; Do[ While[ Abs[s] < 2^n, s = s + MoebiusMu[i]; i++ ]; Print[i - 1], {n, 0, 25}]
Formula
a(n) = A051402(2^n). - Amiram Eldar, May 06 2024
Extensions
Definition corrected by L. Edson Jeffery, Mar 18 2013
a(15)-a(18) by Ashley Jordan and Luke March, Jul 22 2014