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 A190383 #9 Aug 25 2016 22:59:12
%S A190383 36960,43680,57120,63840,68640,77280,89760,96096,97440,100320,104160,
%T A190383 106080,118560,121440,124320,125664,137760,140448,143520,144480,
%U A190383 148512,153120,155040,157920,160160,163680,165984,170016,178080,180960,187110
%N A190383 Numbers with prime factorization pqrst^5.
%H A190383 T. D. Noe, <a href="/A190383/b190383.txt">Table of n, a(n) for n = 1..1000</a>
%H A190383 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%t A190383 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,1,5};Select[Range[500000],f]
%o A190383 (PARI) list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p1=2,sqrtnint(lim\210, 5), t1=p1^5; forprime(p2=2,lim\(30*t1), if(p2==p1, next); t2=p2*t1; forprime(p3=2,lim\(6*t2), if(p3==p1 || p3==p2, next); t3=p3*t2; forprime(p4=2,lim\(2*t3), if(p4==p1 || p4==p2 || p4==p3, next); t4=p4*t3; forprime(p5=2,lim\t4, if(p5==p1 || p5==p2 || p5==p3 || p5==p4, next); listput(v, t4*p5)))))); Set(v) \\ _Charles R Greathouse IV_, Aug 25 2016
%Y A190383 Cf. A190320, A190382.
%K A190383 nonn
%O A190383 1,1
%A A190383 _Vladimir Joseph Stephan Orlovsky_, May 09 2011