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 A124301 #18 Oct 08 2024 15:07:36 %S A124301 1,2,29,242,844,22020,217070,1092747,8870024,221167422,221167422 %N A124301 Smallest number m such that A124300(m) >= n. %C A124301 A008683(a(n) + k) = A008683(a(n)) for 0<=k<=n. %e A124301 a(4) = 844: %e A124301 mu(844) = mu(2*2*211) = 0; %e A124301 mu(844+1) = mu(5*13*13) = 0; %e A124301 mu(844+2) = mu(2*3*3*47) = 0; %e A124301 mu(844+3) = mu(7*11*11) = 0; %e A124301 mu(844+4) = mu(2*2*2*2*53) = 0. %o A124301 (PARI) a(n)={x=1;k=moebius(x);y=n+x;while(x<y,x++;if(moebius(x)!=k,k=moebius(x);y=x+n));x-n} \\ _Jinyuan Wang_, Apr 06 2019 %o A124301 (Python) %o A124301 from itertools import count %o A124301 from sympy import mobius %o A124301 def A124301(n): %o A124301 c, m = 1, 1 %o A124301 for i in count(2): %o A124301 k = mobius(i) %o A124301 if m!=k: %o A124301 if c>n: %o A124301 return i-c %o A124301 c = 0 %o A124301 c += 1 %o A124301 m = k # _Chai Wah Wu_, Oct 08 2024 %Y A124301 Cf. A008683 (Möbius function mu), A124300. %K A124301 nonn,more %O A124301 0,2 %A A124301 _Reinhard Zumkeller_, Oct 25 2006 %E A124301 a(7)-a(8) from Peter T. Wang (peterw(AT)ugcs.caltech.edu), Feb 04 2007 %E A124301 Name edited by and a(9)-a(10) from _Jinyuan Wang_, Apr 06 2019