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 A328579 #7 Oct 20 2019 21:45:26
%S A328579 3,2,5,2,7,2,5,2,7,2,11,2,3,2,11,2,7,2,5,2,13,2,13,2,3,2,13,2,17,2,3,
%T A328579 2,7,2,5,2,5,2,11,2,13,2,3,2,13,2,13,2,5,2,17,2,17,2,3,2,17,2,11,2,3,
%U A328579 2,11,2,7,2,5,2,13,2,13,2,3,2,17,2,17,2,5,2,17,2,19,2,3,2,13,2,19,2,3,2,13,2,17,2,5,2,17,2,17,2,3,2,17,2
%N A328579 a(n) = A053669(A276086(A276086(n))).
%H A328579 Antti Karttunen, <a href="/A328579/b328579.txt">Table of n, a(n) for n = 0..32768</a>
%H A328579 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328579 a(n) = A053669(A276087(n)).
%F A328579 a(n) = A326810(A276086(n)).
%F A328579 a(n) = A000040(A328578(n)).
%F A328579 For all even n, a(n) > A328569(n).
%o A328579 (PARI)
%o A328579 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328579 A326810(n) = { my(i=1, p=2); while(n && (n%p), n = n\p; p = nextprime(1+p)); (p); };
%o A328579 A328579(n) = A326810(A276086(n));
%o A328579 (PARI)
%o A328579 A053669(n) = forprime(p=2, , if(n%p, return(p))); \\ From A053669
%o A328579 A328579(n) = A053669(A276086(A276086(n)));
%Y A328579 Cf. A000040, A053669, A276086, A276087, A326810, A328569, A328578.
%K A328579 nonn
%O A328579 0,1
%A A328579 _Antti Karttunen_, Oct 20 2019