A051401 Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.

3, 5, 13, 31, 110, 114, 197, 199, 443, 659, 661, 665, 1105, 1106, 1109, 1637, 2769, 2770, 2778, 2791, 2794, 2795, 2797, 2802, 2803, 6986, 6987, 7013, 7021, 9717, 9718, 9719, 9721, 9726, 9741, 9749, 9822, 9823, 9830, 9831, 9833, 9857, 9861, 23833

Offset

1,1

Links

T. D. Noe, Table of n, a(n) for n = 1..1000

Maxie Dion Schmidt, Picking up the partial sums of the Möbius function problem with probabilistic number theory, arXiv:2604.23517 [math.NT], 2026. See p. 2 (Theorem 1.3).

Example

M(31) = -4 and that is the first one, so a(4) = 31.

Mathematica

s=0; t=0; Do[s=s+MoebiusMu[n]; If[s<t, t=s; Print[n]], {n, 1, 24100}] (* Robert G. Wilson v, Jul 03 2000 *)

Crossrefs

Cf. A002321, A008683, A051400, A051402.

Sequence in context: A394209 A127600 A262237 * A304357 A296023 A027039

Adjacent sequences: A051398 A051399 A051400 * A051402 A051403 A051404

Keyword

nonn

Author

Jud McCranie

Status

approved