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 A328839 #8 Oct 29 2019 21:05:44
%S A328839 4,15,4,21,4,25,4,21,4,33,4,15,4,33,4,21,4,25,4,39,4,39,4,15,4,39,4,
%T A328839 51,4,21,4,21,4,15,4,25,4,33,4,39,4,15,4,39,4,39,4,25,4,51,4,51,4,15,
%U A328839 4,51,4,33,4,21,4,33,4,21,4,25,4,39,4,39,4,15,4,51,4,51,4,25,4,51,4,57,4,15,4,39,4,57,4,21,4,39,4,51,4
%N A328839 Smallest prime not dividing n times smallest prime not dividing A276087(n).
%H A328839 Antti Karttunen, <a href="/A328839/b328839.txt">Table of n, a(n) for n = 1..32768</a>
%H A328839 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A328839 a(n) = A053669(n) * A328579(n).
%o A328839 (PARI)
%o A328839 A053669(n) = forprime(p=2, , if(n%p, return(p))); \\ From A053669
%o A328839 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328839 A328579(n) = A053669(A276086(A276086(n)));
%o A328839 A328839(n) = (A053669(n) * A328579(n));
%Y A328839 Cf. A010709 (odd bisection), A053669, A276086, A276087, A328578, A328579.
%Y A328839 Cf. A328585 (positions of the prime squares).
%K A328839 nonn
%O A328839 1,1
%A A328839 _Antti Karttunen_, Oct 29 2019