login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A081222
Smallest number m with Sum_{k=n..n+m} mu(k) = 0, where mu=A008683 (Möbius function).
1
1, 92, 36, 0, 1, 1, 3, 0, 0, 1, 4, 0, 1, 5, 2, 0, 5, 0, 2, 0, 9, 1, 3, 0, 0, 3, 0, 0, 6, 4, 2, 0, 40, 9, 2, 0, 1, 4, 2, 0, 17, 15, 3, 0, 0, 1, 4, 0, 0, 0, 2, 0, 2, 0, 16, 0, 4, 1, 6, 0, 1, 5, 0, 0, 1, 27, 2, 0, 1, 17, 6, 0, 1, 5, 0, 0, 1, 8, 3, 0, 0, 1, 2, 0, 24, 19, 2, 0, 2, 0, 12, 0, 9, 7, 2, 0, 120, 0, 0
OFFSET
1,2
COMMENTS
a(n) = 0 if and only if n is in A013929. - Robert Israel, Jan 21 2019
LINKS
MAPLE
f:= proc(n) local t, k;
t:= 0;
for k from n do
t:= t + numtheory:-mobius(k);
if t=0 then return k-n fi
od
end proc:
map(f, [$1..100]); # Robert Israel, Jan 21 2019
MATHEMATICA
a[n_] := Module[{t = 0, k}, For[k = n, True, k++, t += MoebiusMu[k]; If[t == 0, Return[k - n]]]];
Array[a, 100] (* Jean-François Alcover, Aug 24 2020, after Maple *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 10 2003
EXTENSIONS
Corrected by Robert Israel, Jan 21 2019
STATUS
approved