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 A324283 #9 Feb 20 2019 21:44:00
%S A324283 1,3,6,9,18,18,10,15,30,54,90,54,50,30,108,225,450,90,250,162,60,270,
%T A324283 2250,90,1250,150,3750,90,11250,324,14,21,540,1350,180,270,70,750,300,
%U A324283 270,630,180,350,810,540,6750,3150,1350,1750,3750,2700,450,15750,11250,1620,150,1500,33750,78750,972,98,42,300,441,900
%N A324283 Multiplicative with a(p^e) = A276086(p^e).
%H A324283 Antti Karttunen, <a href="/A324283/b324283.txt">Table of n, a(n) for n = 1..10000</a>
%H A324283 Antti Karttunen, <a href="/A324283/a324283.txt">Data supplement: n, a(n) computed for n = 1..30030</a>
%H A324283 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A324283 (PARI)
%o A324283 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324283 A324283(n) = { my(f=factor(n)); prod(i=1, #f~, A276086(f[i,1]^f[i,2])); };
%Y A324283 Cf. A276086, A319708, A323878, A324284.
%K A324283 nonn,base,mult
%O A324283 1,2
%A A324283 _Antti Karttunen_, Feb 20 2019