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 A100306 #30 Dec 22 2024 12:10:43 %S A100306 1,3,40,41,59,66,94,102,146,150,151,160,161,164,165,167,215,232,233, %T A100306 236,237,239,255,330,332,333,334,354,356,357,359,363,364,365,367,394, %U A100306 402,404,405,406,408,409,414,415,420,421,423,424,425,426,428,429,538,542 %N A100306 Numbers for which the values of the Moebius function (A008683) and the Mertens function (A002321) agree. %H A100306 Donovan Johnson, <a href="/A100306/b100306.txt">Table of n, a(n) for n = 1..10000</a> %H A100306 PrimeFan, <a href="http://primefan.tripod.com/EsotericIntegerSequences.html">Esoteric Integer Sequences</a> %H A100306 PrimeFan, <a href="/A031214/a031214.pdf">Esoteric Integer Sequences</a> [Cached copy] %p A100306 with(numtheory): p:=proc(n) if mobius(n)=sum(mobius(k),k=1..n) then n else fi end: seq(p(n),n=1..700); # _Emeric Deutsch_, Feb 14 2005 %t A100306 Select[Range[500], Plus @@ MoebiusMu[Range[#]] == MoebiusMu[#] &] (* _Carl Najafi_, Aug 17 2011 *) %o A100306 (PARI) s=0; for(n=1,1e4, s+=t=moebius(n); if(t==s, print1(n", "))) \\ _Charles R Greathouse IV_, Jan 28 2014 %Y A100306 Cf. A100765, A100766, A100767. %K A100306 nonn %O A100306 1,2 %A A100306 _N. J. A. Sloane_, Dec 30 2004 %E A100306 More terms from _Emeric Deutsch_, Feb 14 2005