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 A046390 #25 Dec 06 2024 12:22:20
%S A046390 1155,1365,1785,1995,2145,2415,2805,3003,3045,3135,3255,3315,3705,
%T A046390 3795,3885,3927,4305,4389,4485,4515,4641,4785,4845,4935,5005,5115,
%U A046390 5187,5313,5565,5655,5865,6045,6105,6195,6279,6405,6545,6555,6699,6765,6783,7035
%N A046390 Squarefree odd numbers with exactly 4 distinct prime factors.
%H A046390 T. D. Noe, <a href="/A046390/b046390.txt">Table of n, a(n) for n=1..1000</a>
%t A046390 f[n_]:=Last/@FactorInteger[n]=={1,1,1,1}&&FactorInteger[n][[1,1]]>2; lst={};Do[If[f[n],AppendTo[lst,n]],{n,8!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 23 2009 *)
%t A046390 Select[Range[1,8001,2],PrimeNu[#]==PrimeOmega[#]==4&] (* _Harvey P. Dale_, Mar 28 2013 *)
%o A046390 (PARI) list(lim)=my(v=List()); forprime(p=3,sqrtnint(lim\=1,4), forprime(q=p+2,sqrtnint(lim\p,3), forprime(r=q+2,sqrtint(lim\p\q), my(t=p*q*r); forprime(s=r+2,lim\t, listput(v,t*s))))); Set(v) \\ _Charles R Greathouse IV_, Dec 06 2024
%Y A046390 Cf. A046317, A046406.
%K A046390 nonn
%O A046390 1,1
%A A046390 _Patrick De Geest_, Jun 15 1998