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 A329030 #5 Nov 07 2019 14:38:52
%S A329030 2,2,2,2,2,1,3,3,3,2,3,1,2,2,3,1,3,3,3,3,3,1,3,1,3,2,3,2,3,1,2,3,2,3,
%T A329030 3,2,3,3,4,2,4,1,2,2,4,1,4,2,3,3,4,1,5,1,2,2,4,1,5,3,2,2,2,3,4,3,3,3,
%U A329030 4,1,4,2,2,2,4,1,5,1,3,4,4,3,4,1,3,6,4,2,4,2,3,2,2,1,2,1,3,3,4,1,4,2,2,2,4,2
%N A329030 The least missing nonzero digit in the primorial base expansion of A276086(n).
%H A329030 Antti Karttunen, <a href="/A329030/b329030.txt">Table of n, a(n) for n = 0..32768</a>
%H A329030 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A329030 a(n) = A329028(A276086(n)) = A134193(A276087(n)) .
%o A329030 (PARI)
%o A329030 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A329030 A329028(n) = { my(m=Map(), p=2); while(n, mapput(m,(n%p),1); n = n\p; p = nextprime(1+p)); for(k=1,oo,if(!mapisdefined(m,k),return(k))); };
%o A329030 A329030(n) = A329028(A276086(n));
%Y A329030 Cf. A134193, A276086, A276087, A329028.
%K A329030 nonn
%O A329030 0,1
%A A329030 _Antti Karttunen_, Nov 07 2019