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 A328829 #6 Oct 30 2019 09:24:14
%S A328829 0,0,0,0,0,3,2,2,3,0,3,4,3,3,3,4,3,5,2,2,3,4,3,4,3,3,3,4,3,4,0,3,3,3,
%T A328829 4,4,2,2,3,0,3,5,3,3,3,5,3,5,2,2,3,5,3,5,3,3,3,5,3,6,3,4,3,3,3,3,2,2,
%U A328829 3,5,3,5,3,3,3,5,3,5,2,2,3,5,3,5,3,3,3,5,3,5,3,3,4,3,3,3,2,2,3,5,3,5,3,3,3,5
%N A328829 Index of the least significant digit > 1 in the primorial base expansion of A276086(n), 0 if no such digit exists.
%C A328829 a(n) = index of the least non-unitary prime divisor of A276087(n) or 0 if no such prime-divisor exists.
%H A328829 Antti Karttunen, <a href="/A328829/b328829.txt">Table of n, a(n) for n = 0..65537</a>
%H A328829 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328829 a(n) = A328828(A276086(n)) = A277885(A276087(n)).
%o A328829 (PARI)
%o A328829 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328829 A328828(n) = { my(i=1, p=2); while(n, if((n%p)>1, return(i)); i++; n = n\p; p = nextprime(1+p)); (0); };
%o A328829 A328829(n) = A328828(A276086(n));
%o A328829 (PARI)
%o A328829 A277885(n) = if(1==n,0,my(f=factor(n)); for(i=1,#f~,if(f[i,2]>1,return(primepi(f[i,1])))); (0));
%o A328829 A328829(n) = A277885(A276086(A276086(n)));
%Y A328829 Cf. A276086, A276087, A277885, A328828, A328836 (positions of zeros).
%K A328829 nonn
%O A328829 0,6
%A A328829 _Antti Karttunen_, Oct 29 2019