OFFSET
1,1
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000 (terms 1..5361 from T. D. Noe)
Eric Weisstein's World of Mathematics, Mertens Function.
MATHEMATICA
Select[Range[500], Plus@@MoebiusMu[Range[#]] == 0 &] (* Alonso del Arte, Jul 06 2004 *)
seq[kmax_] := Position[Accumulate[MoebiusMu[Range[kmax]]], 0] // Flatten; seq[500] (* Amiram Eldar, Jun 09 2024 *)
PROG
(Perl) use ntheory ":all"; for (moebius(1, 1e7)) { ++$i; say $i unless $M+=$_; } # Dana Jacobsen, May 22 2015
(PARI) isok(n) = sum(k=1, n, moebius(k)) == 0; \\ Michel Marcus, Nov 20 2017
(PARI) lista(kmax) = {my(s = 0); for(k = 1, kmax, s += moebius(k); if(s == 0, print1(k, ", "))); } \\ Amiram Eldar, Jun 09 2024
(Magma) M := func<i | &+[MoebiusMu(k): k in [1..i]]>; [n: n in [1..500] | M(n) eq 0]; // Bruno Berselli, Jul 12 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved