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 A324534 #7 Mar 11 2019 20:47:09
%S A324534 1,3,2,1,2,1,2,3,1,3,2,1,2,3,2,1,2,1,2,3,2,3,2,5,1,3,2,1,2,1,2,3,2,3,
%T A324534 2,7,2,3,2,3,2,1,2,3,2,3,2,1,1,3,2,7,2,5,2,3,2,3,2,7,2,3,2,1,2,1,2,3,
%U A324534 2,3,2,5,2,3,2,5,2,7,2,3,1,3,2,7,2,3,2,3,2,1,2,3,2,3,2,7,2,3,2,7,2,1,2,3,2
%N A324534 The smallest common prime factor of sigma(n) and A276086(n), or 1 if no such prime exists.
%H A324534 Antti Karttunen, <a href="/A324534/b324534.txt">Table of n, a(n) for n = 1..30030</a>
%H A324534 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A324534 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%H A324534 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A324534 a(n) = A020639(A324644(n)) = A020639(gcd(A000203(n),A276086(n))).
%o A324534 (PARI)
%o A324534 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324534 A020639(n) = if(1==n, n, factor(n)[1, 1]);
%o A324534 A324534(n) = A020639(gcd(sigma(n),A276086(n)));
%Y A324534 Cf. A000203, A020639, A276086, A324644.
%K A324534 nonn
%O A324534 1,2
%A A324534 _Antti Karttunen_, Mar 11 2019