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 A100765 #20 Dec 22 2024 12:13:25
%S A100765 3,41,59,66,102,151,165,167,233,239,255,354,357,359,367,402,406,409,
%T A100765 421,426,429,609,638,782,786,797,826,854,885,887,890,894,897,907,911,
%U A100765 1015,1019,1221,1259,1281,1283,1298,1301,1303,1307,1319,1327,1493,1526,1533
%N A100765 Numbers for which the values of the Moebius function (A008683) and the Mertens function (A002321) are both -1.
%C A100765 This sequence is a subsequence of A100306, Numbers for which the values of the Moebius function and the Mertens function agree.
%H A100765 Donovan Johnson, <a href="/A100765/b100765.txt">Table of n, a(n) for n = 1..10000</a>
%H A100765 PrimeFan, <a href="http://primefan.tripod.com/EsotericIntegerSequences.html">Esoteric Integer Sequences</a>
%H A100765 PrimeFan, <a href="/A031214/a031214.pdf">Esoteric Integer Sequences</a> [Cached copy]
%e A100765 102 is in the sequence because it is a sphenic number (exactly 3 distinct prime factors, A007304) number, so the Mobius function yields -1 and the sum of that value and the previous Mobius values (the Mertens function) is also -1.
%t A100765 (* If not already defined *) If[Names["Mertens"] == {}, Mertens[x_] := Plus @@ MoebiusMu[Range[1, x]]]; Select[Range[2500], MoebiusMu[ # ] == -1 && Mertens[ # ] == -1 &]
%Y A100765 Cf. A100306, A100766, A100767.
%K A100765 nonn
%O A100765 1,1
%A A100765 _Alonso del Arte_, Jan 03 2005
%E A100765 Offset corrected by _Donovan Johnson_, Jun 19 2012