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 A093599 #31 Feb 16 2025 08:32:53 %S A093599 30,42,66,70,78,102,105,110,114,130,138,154,165,170,174,182,186,190, %T A093599 195,222,230,231,238,246,255,258,266,273,282,285,286,290,310,318,322, %U A093599 345,354,357,366,370,374,385,399,402,406,410,418,426,429,430,434,435 %N A093599 Composite numbers having an odd number of prime factors, all of which are distinct. %C A093599 First differs from A007304 at 2*3*5*7*11 = 2310, which is a(360) and thus beyond the tabulated range. %C A093599 Subsequence of A030059. - _Bill McEachen_, Nov 06 2020 %H A093599 Carl R. White, <a href="/A093599/b093599.txt">Table of n, a(n) for n = 1..10000</a> %H A093599 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeSums.html">Prime Sums</a> %H A093599 Wikipedia, <a href="http://en.wikipedia.org/wiki/M%F6bius_function">Moebius function</a> %t A093599 Select[Range[435], MoebiusMu[ # ] == -1 && Not[PrimeQ[ # ]] &] (* _Alonso del Arte_, Jan 24 2005 *) %o A093599 (PARI) is(n)=my(f=factor(n)[,2]); #f>2 && #f%2==1 && vecmax(f)==1 \\ _Charles R Greathouse IV_, Oct 19 2015 %Y A093599 Cf. A007304, A030059. %K A093599 nonn %O A093599 1,1 %A A093599 _Eric W. Weisstein_, Apr 03 2004