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 A190386 #9 Aug 25 2016 23:09:21
%S A190386 138600,163800,194040,207900,214200,229320,239400,245700,257400,
%T A190386 289800,291060,299880,304920,321300,323400,335160,336600,343980,
%U A190386 346500,359100,365400,376200,382200,386100,390600,397800,405720,409500,425880,434700
%N A190386 Numbers with prime factorization pqr^2s^2t^3.
%H A190386 T. D. Noe, <a href="/A190386/b190386.txt">Table of n, a(n) for n = 1..1000</a>
%H A190386 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%t A190386 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,2,2,3};Select[Range[600000],f]
%o A190386 (PARI) list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p=2,sqrtnint(lim\1260, 3), t1=p^3; 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 A190386 Cf. A190383, A190384, A190385.
%K A190386 nonn
%O A190386 1,1
%A A190386 _Vladimir Joseph Stephan Orlovsky_, May 09 2011