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 A189985 #11 May 20 2017 10:47:22
%S A189985 60060,78540,87780,90090,92820,103740,106260,117810,125580,131670,
%T A189985 133980,135660,139230,143220,145860,150150,155610,158340,159390,
%U A189985 163020,164220,169260,170940,183540,188370,189420,196350,197340,198660,200970
%N A189985 Numbers with prime factorization pqrstu^2.
%H A189985 T. D. Noe, <a href="/A189985/b189985.txt">Table of n, a(n) for n = 1..1000</a>
%H A189985 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%H A189985 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%t A189985 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,1,1,2}; Select[Range[300000],f]
%o A189985 (PARI) list(lim)=my(v=List(),t1,t2,t3,t4,t5); forprime(p=2,sqrtint(lim\2310), t1=p^2; forprime(q=2,lim\(210*t1), if(q==p, next); t2=q*t1; forprime(r=2,lim\(30*t2), if(r==p || r==q, next); t3=r*t2; forprime(s=2,lim\(6*t3), if(s==p || s==q || s==r, next); t4=s*t3; forprime(t=2,lim\(2*t4), if(t==p || t==q || t==r || t==s, next); t5=t*t4; forprime(u=2,lim\t5, if(u==p || u==q || u==r || u==s || u==t, next); listput(v, t5*u))))))); Set(v) \\ _Charles R Greathouse IV_, Aug 25 2016
%Y A189985 Cf. A179693, A189984.
%K A189985 nonn
%O A189985 1,1
%A A189985 _Vladimir Joseph Stephan Orlovsky_, May 03 2011