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 A176170 #8 Dec 06 2017 20:08:25
%S A176170 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,
%T A176170 2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,
%U A176170 2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,3,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,2
%N A176170 Smallest prime-factor of n-th product of 4 distinct primes.
%C A176170 FactorInteger[210]=2*3*5*7,...
%H A176170 Antti Karttunen, <a href="/A176170/b176170.txt">Table of n, a(n) for n = 1..10000</a>
%F A176170 a(n) = A020639(A046386(n)). - _Antti Karttunen_, Dec 06 2017
%t A176170 f0[n_]:=Last/@FactorInteger[n]=={1,1,1,1};f1[n_]:=Min[First/@FactorInteger[n]];f2[n_]:=First/@FactorInteger[n][[2,1]];f3[n_]:=First/@FactorInteger[n][[3,1]];f4[n_]:=Max[First/@FactorInteger[n]];lst={};Do[If[f0[n],AppendTo[lst,f1[n]]],{n,0,2*7!}];lst
%o A176170 (PARI) n=0; i=0; while(i<10000,n++;if((4 == bigomega(n))&&(4 == omega(n)),i++;write("b176170.txt", i, " ", factor(n)[1,1]))); \\ _Antti Karttunen_, Dec 06 2017
%Y A176170 Cf. A020639, A046386, A006881, A007304, A070647, A096916, A096917, A096918, A096919
%K A176170 nonn
%O A176170 1,1
%A A176170 _Vladimir Joseph Stephan Orlovsky_, Apr 10 2010