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 A328766 #9 Oct 28 2019 20:00:46
%S A328766 0,1,0,2,0,2,0,1,0,3,0,3,1,1,0,3,1,3,1,1,0,3,0,3,1,1,0,3,0,3,1,1,0,2,
%T A328766 1,2,1,1,0,4,0,4,1,1,0,4,0,4,1,1,0,4,0,4,1,1,0,4,1,4,1,1,0,2,1,2,1,1,
%U A328766 0,4,0,4,1,2,0,4,0,4,1,1,0,4,0,4,2,2,1,4,0,4,1,1,0,2,0,2,1,1,0,4,0,5,1,1,0,4
%N A328766 Number of nonleading zeros in primorial base expansion of A276086(n).
%H A328766 Antti Karttunen, <a href="/A328766/b328766.txt">Table of n, a(n) for n = 0..32768</a>
%H A328766 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328766 a(n) = A328620(A276086(n)) = A079067(A276087(n)).
%F A328766 a(n) = A001221(A328763(n)) - 1.
%F A328766 For all n >= 1, a(A143293(n-1)) = n. [Note however that these are not the first occurrences of each n, that is, A143293 does not give the indices of records]
%o A328766 (PARI)
%o A328766 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328766 A328620(n) = { my(s=0, p=2); while(n, s += (0==(n%p)); n = n\p; p = nextprime(1+p)); (s); };
%o A328766 A328766(n) = A328620(A276086(n));
%Y A328766 Cf. A079067, A143293, A276086, A276087, A328620, A328763.
%Y A328766 Cf. also A328578.
%K A328766 nonn
%O A328766 0,4
%A A328766 _Antti Karttunen_, Oct 28 2019