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 A190319 #9 Aug 25 2016 23:03:14
%S A190319 25200,35280,39600,46800,56700,58800,61200,68400,77616,79380,82800,
%T A190319 87120,89100,91728,104400,105300,111600,119952,121680,121968,133200,
%U A190319 134064,137700,145200,147600,153900,154800,157500,162288,169200,170352
%N A190319 Numbers with prime factorization pq^2r^2s^4.
%H A190319 T. D. Noe, <a href="/A190319/b190319.txt">Table of n, a(n) for n = 1..1000</a>
%H A190319 Will Nicholes,<a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%t A190319 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,2,2,4};Select[Range[250000],f]
%o A190319 (PARI) list(lim)=my(v=List(),t1,t2,t3); forprime(p=2,sqrtnint(lim\180, 4), t1=p^4; forprime(q=2,sqrtint(lim\(12*t1)), if(q==p, next); t2=q^2*t1; forprime(r=2,sqrtint(lim\(2*t2)), if(r==p || r==q, next); t3=r^2*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
%Y A190319 Cf. A190293, A190294.
%K A190319 nonn
%O A190319 1,1
%A A190319 _Vladimir Joseph Stephan Orlovsky_, May 08 2011