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 A329032 #11 Nov 07 2019 14:39:11
%S A329032 0,0,0,0,1,1,0,0,0,0,1,1,1,1,1,1,8,8,10,10,10,10,55,55,75,75,75,75,
%T A329032 350,350,0,0,0,0,1,1,0,0,0,0,1,1,1,1,1,1,8,8,10,10,10,10,55,55,75,75,
%U A329032 75,75,350,350,1,1,1,1,10,10,1,1,1,1,10,10,12,12,12,12,71,71,95,95,95,95,460,460,650,650,650,650,2825,2825,14,14,14,14
%N A329032 a(n) = A327860(A328842(n)).
%H A329032 Antti Karttunen, <a href="/A329032/b329032.txt">Table of n, a(n) for n = 0..2589</a>
%H A329032 Antti Karttunen, <a href="/A329032/a329032.txt">Data supplement: n, a(n) computed for n = 0..32768</a>
%H A329032 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A329032 a(n) = A327860(A328842(n)) = A003415(A276086(A328842(n))) = A003415(A328572(n)).
%o A329032 (PARI) A329032(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); if(e, m *= (p^(e-1)); s += ((e-1)/p)); n = n\p; p = nextprime(1+p)); (s*m); };
%Y A329032 Cf. A003415, A276086, A327860, A328572, A328842, A329031.
%Y A329032 Cf. A276156 (positions of zeros).
%K A329032 nonn
%O A329032 0,17
%A A329032 _Antti Karttunen_, Nov 07 2019