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 A190475 #9 Aug 25 2016 23:14:15
%S A190475 30240,47520,56160,66528,68040,73440,78624,82080,84000,99360,102816,
%T A190475 106920,114912,123552,125280,126360,132000,133920,139104,149688,
%U A190475 156000,159840,161568,164640,165240,175392,176904,177120,180576,184680,185760
%N A190475 Numbers with prime factorization pqr^3s^5.
%H A190475 T. D. Noe, <a href="/A190475/b190475.txt">Table of n, a(n) for n = 1..1000</a>
%H A190475 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%t A190475 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,3,5}; Select[Range[400000],f]
%o A190475 (PARI) list(lim)=my(v=List(),t1,t2,t3); forprime(p=2,sqrtnint(lim\120, 5), t1=p^5; forprime(q=2,sqrtnint(lim\(6*t1), 3), if(q==p, next); t2=q^3*t1; forprime(r=2,lim\(2*t2), if(r==p || r==q, next); t3=r*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 A190475 Cf. A190472, A190473, A190474.
%K A190475 nonn
%O A190475 1,1
%A A190475 _Vladimir Joseph Stephan Orlovsky_, May 10 2011