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 A189983 #10 Aug 25 2016 23:12:04
%S A189983 4620,5460,6930,7140,7980,8190,8580,9660,10710,11220,11550,11970,
%T A189983 12012,12180,12540,12870,13020,13260,13650,14490,14820,15180,15540,
%U A189983 15708,16170,16830,17220,17556,17850,17940,18018,18060,18270,18564,18810,19110,19140,19380
%N A189983 Numbers with prime factorization pqrst^2.
%H A189983 T. D. Noe, <a href="/A189983/b189983.txt">Table of n, a(n) for n = 1..1000</a>
%H A189983 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%t A189983 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,1,2}; Select[Range[30000],f]
%o A189983 (PARI) list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p=2,sqrtint(lim\210), t1=p^2; forprime(q=2,lim\(30*t1), if(q==p, next); t2=q*t1; forprime(r=2,lim\(6*t2), if(r==p || r==q, next); t3=r*t2; forprime(s=2,lim\(2*t3), if(s==p || s==q || s==r, next); t4=s*t3; forprime(t=2,lim\t4, if(t==p || t==q || t==r || t==s, next); listput(v, t4*t)))))); Set(v) \\ _Charles R Greathouse IV_, Aug 25 2016
%Y A189983 Cf. A178740, A179644, A179670.
%K A189983 nonn
%O A189983 1,1
%A A189983 _Vladimir Joseph Stephan Orlovsky_, May 03 2011