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 A084234 #13 May 06 2024 01:42:46
%S A084234 1,31,443,1637,2803,9749,19111,24110,42833,59426,95514,230227,297335,
%T A084234 297573,299129,355541,897531,924717,926173,1062397,1761649,1763079,
%U A084234 1789062,3214693,3218010,3232958,4962865,5307549,5343710,6433477,6435874,6473791,9990083,10188647
%N A084234 Smallest k such that |M(k)| = n^2, where M(x) is Mertens's function A002321.
%C A084234 "[I]f the absolute value of M(n) can be proved to be always less than the square root of n, then the Riemann Hypothesis is true. This is called Mertens's conjecture. ... Then along came Andrew Odlyzko and his colleague, Herman te Riele and they showed in 1984 that there is a number, far larger than 10^30, that invalidates Mertens's conjecture - call it N. In other words, M(N) is greater than the square of N. So the conjecture is not true." [Sabbagh]
%D A084234 Karl Sabbagh, The Riemann Hypothesis, The Greatest Unsolved Problem in Mathematics, Farrar, Straus and Giroux, New York, 2002, page 191.
%H A084234 Amiram Eldar, <a href="/A084234/b084234.txt">Table of n, a(n) for n = 1..100</a> (calculated using the b-file at A051402)
%F A084234 a(n) = A051402(n^2). - _Amiram Eldar_, May 06 2024
%t A084234 i = s = 0; Do[While[Abs[s] < n^2, s = s + MoebiusMu[i]; i++ ]; Print[i - 1], {n, 1, 25}]
%Y A084234 Cf. A002321, A051402.
%K A084234 nonn
%O A084234 1,2
%A A084234 _Robert G. Wilson v_, May 13 2003
%E A084234 a(31)-a(34) from _Amiram Eldar_, May 06 2024