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 A328844 #5 Nov 01 2019 18:40:14 %S A328844 0,0,0,0,0,12,2,2,6,0,6,60,18,12,36,120,6,210,92,2,126,510,876,2010, %T A328844 378,1002,1626,1200,3066,8700,0,6,12,6,30,90,2,32,66,0,66,420,138,102, %U A328844 276,840,1326,630,632,1502,66,2730,5316,13230,1818,6192,10566,23730,6996,46200,12,60,108,48,222,636,2,242,486,1260,1956,1890,978,102 %N A328844 a(n) = A328842(A276086(n)). %H A328844 Antti Karttunen, <a href="/A328844/b328844.txt">Table of n, a(n) for n = 0..32768</a> %H A328844 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328844 a(n) = A328842(A276086(n)). %F A328844 a(n) = A276086(n) - A328843(n). %o A328844 (PARI) %o A328844 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; %o A328844 A328842(n) = { my(p=2, r=1, s=0); while(n, if((n%p)>0, s += ((n%p)-1)*r); r *= p; n = n\p; p = nextprime(1+p)); (s); }; %o A328844 A328844(n) = A328842(A276086(n)); %Y A328844 Cf. A276086, A328842, A328843. %Y A328844 Cf. A328836 (positions of zeros). %K A328844 nonn %O A328844 0,6 %A A328844 _Antti Karttunen_, Oct 30 2019