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 A328763 #7 Oct 28 2019 20:00:22
%S A328763 3,10,5,42,7,126,5,14,7,330,11,990,21,22,11,1650,91,5850,55,26,13,
%T A328763 9750,13,29250,39,26,13,63750,17,191250,21,14,7,66,55,198,55,22,11,
%U A328763 2730,13,8190,33,26,13,13650,13,53550,65,26,17,89250,17,267750,37179,34,17,446250,209,1496250,33,22,11,78,91,234,65,26,13,19110,13,74970,117,374,17
%N A328763 a(n) = A328613(A276086(n)).
%H A328763 Antti Karttunen, <a href="/A328763/b328763.txt">Table of n, a(n) for n = 0..2559</a>
%H A328763 Antti Karttunen, <a href="/A328763/a328763.txt">Data supplement: n, a(n) computed for n = 0..32768</a>
%H A328763 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328763 a(n) = A328613(A276086(n)).
%F A328763 A055396(a(n)) = A328578(n).
%o A328763 (PARI)
%o A328763 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328763 A328613(n) = { my(m=1, p=2); while(n, m *= p^valuation(n,p); n = n\p; p = nextprime(1+p)); (m*p); };
%o A328763 A328763(n) = A328613(A276086(n));
%Y A328763 Cf. A055396, A276086, A328578, A328613, A328764 (rgs-transform).
%K A328763 nonn
%O A328763 0,1
%A A328763 _Antti Karttunen_, Oct 28 2019