This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A084235 #29 May 06 2024 01:42:51
%S A084235 1,5,31,199,1637,8507,24110,95961,355541,1786062,6473791,30649362,
%T A084235 109851909,456774199,2589994747,7613644886,37725066313,108500046711
%N A084235 Smallest k such that |M(k)| = 2^n, where M(x) is Mertens's function A002321.
%D A084235 Karl Sabbagh, The Riemann Hypothesis, The Greatest Unsolved Problem in Mathematics, Farrar, Straus and Giroux, New York, 2002, page 191.
%F A084235 a(n) = A051402(2^n). - _Amiram Eldar_, May 06 2024
%t A084235 i = s = 0; Do[ While[ Abs[s] < 2^n, s = s + MoebiusMu[i]; i++ ]; Print[i - 1], {n, 0, 25}]
%Y A084235 Cf. A002321, A051402, A084234.
%K A084235 nonn,more
%O A084235 1,2
%A A084235 _Robert G. Wilson v_, May 13 2003
%E A084235 Definition corrected by _L. Edson Jeffery_, Mar 18 2013
%E A084235 a(15)-a(18) by Ashley Jordan and _Luke March_, Jul 22 2014