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 A179670 #24 Feb 21 2024 01:48:06
%S A179670 840,1320,1560,1848,1890,2040,2184,2280,2760,2856,2970,3080,3192,3432,
%T A179670 3480,3510,3640,3720,3864,4158,4440,4488,4590,4760,4872,4914,4920,
%U A179670 5016,5130,5160,5208,5250,5304,5320,5640,5720,5928,6072,6210,6216,6360,6426
%N A179670 Numbers of the form p^3*q*r*s where p, q, r, and s are distinct primes.
%C A179670 A050326(a(n)) = 7. - _Reinhard Zumkeller_, May 03 2013
%H A179670 T. D. Noe, <a href="/A179670/b179670.txt">Table of n, a(n) for n = 1..1000</a>
%H A179670 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%H A179670 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%t A179670 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,3}; Select[Range[10000], f]
%t A179670 Take[#[[1]]^3 #[[2]]#[[3]]#[[4]]&/@Flatten[Permutations/@Subsets[Prime[ Range[20]],{4}],1]//Union,50] (* _Harvey P. Dale_, May 16 2021 *)
%o A179670 (PARI) list(lim)=my(v=List(),t1,t2,t3); forprime(p=2,sqrtnint(lim\30, 3), t1=p^3; forprime(q=2,lim\(6*t1), if(q==p, next); t2=q*t1; forprime(r=2,lim\(2*t2), if(r==p || r==q, next); t3=r*t2; forprime(s=2,lim\t3, if(s==p || s==q || s==r, next); listput(v, t3*s))))); Set(v) \\ _Charles R Greathouse IV_, Aug 25 2016
%K A179670 nonn
%O A179670 1,1
%A A179670 _Vladimir Joseph Stephan Orlovsky_, Jul 23 2010