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 A190379 #11 May 20 2017 11:47:21
%S A190379 69300,81900,97020,107100,114660,119700,128700,144900,149940,152460,
%T A190379 161700,167580,168300,182700,188100,191100,195300,198900,202860,
%U A190379 212940,222300,227700,233100,242550,249900,252252,254100,255780,258300,269100
%N A190379 Numbers with prime factorization pqr^2s^2t^2.
%H A190379 T. D. Noe, <a href="/A190379/b190379.txt">Table of n, a(n) for n = 1..1000</a>
%H A190379 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%H A190379 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%t A190379 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,2,2,2};Select[Range[600000],f]
%o A190379 (PARI) list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p=2,sqrtint(lim\1260), t1=p^2; forprime(q=2,sqrtint(lim\(60*t1)), if(q==p, next); t2=q^2*t1; forprime(r=2,sqrtint(lim\(6*t2)), if(r==p || r==q, next); t3=r^2*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 A190379 Cf. A190110, A190111.
%K A190379 nonn
%O A190379 1,1
%A A190379 _Vladimir Joseph Stephan Orlovsky_, May 09 2011