|
Search: id:A051402
|
|
|
| A051402 |
|
Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321 |
|
+0
7
|
|
| 1, 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, 8503, 8506, 8507, 8509, 8510, 8511, 9749, 9822, 9823, 9830, 9831, 9833, 9857, 9861, 19043
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
EXAMPLE
|
M(31) = -4, smallest one equal to +/-4.
|
|
MAPLE
|
with(numtheory): k := 0: s := 0: for n from 1 to 20000 do s := s+mobius(n): if abs(s) > k then k := abs(s): print(n); fi; od:
|
|
MATHEMATICA
|
a = s = 0; Do[s = s + MoebiusMu[n]; If[ Abs[s] > a, a = Abs[s]; Print[n]], {n, 1, 20000}]
|
|
CROSSREFS
|
Cf. A002321, A051400, A051401.
Essentially same as A060434 except for initial terms.
Sequence in context: A007708 A146609 A121129 this_sequence A147022 A147014 A146376
Adjacent sequences: A051399 A051400 A051401 this_sequence A051403 A051404 A051405
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
