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 A328572 #22 Mar 12 2021 23:49:23
%S A328572 1,1,1,1,3,3,1,1,1,1,3,3,5,5,5,5,15,15,25,25,25,25,75,75,125,125,125,
%T A328572 125,375,375,1,1,1,1,3,3,1,1,1,1,3,3,5,5,5,5,15,15,25,25,25,25,75,75,
%U A328572 125,125,125,125,375,375,7,7,7,7,21,21,7,7,7,7,21,21,35,35,35,35,105,105,175,175,175,175,525,525,875,875,875,875
%N A328572 Primorial base expansion of n converted into its prime product form, but with 1 subtracted from all nonzero digits: a(n) = A003557(A276086(n)).
%H A328572 Antti Karttunen, <a href="/A328572/b328572.txt">Table of n, a(n) for n = 0..2310</a>
%H A328572 Antti Karttunen, <a href="/A328572/a328572.txt">Data supplement: n, a(n) computed for n = 0..32768</a>
%H A328572 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328572 a(n) = A003557(A276086(n)).
%F A328572 a(n) = A276086(n) / A328571(n).
%F A328572 a(n) = A328475(n) / A328573(n).
%F A328572 For all n >= 1, 1+A051903(a(n)) = A328114(n).
%F A328572 a(n) = A085731(A276086(n)) = gcd(A276086(n), A327860(n)). - _Antti Karttunen_, Feb 28 2021
%t A328572 Block[{b = MixedRadix[Reverse@ Prime@ Range@ 12]}, Array[#1/(Times @@ #2[[All, 1]]) & @@ {#1, FactorInteger[#]} &[Times @@ Power @@@ #] &@ Transpose@ {Prime@ Range@ Length@ #, Reverse@ #} &@ IntegerDigits[#, b] &, 87, 0]] (* _Michael De Vlieger_, Mar 12 2021 *)
%o A328572 (PARI) A328572(n) = { my(m=1, p=2); while(n, if(n%p, m *= p^((n%p)-1)); n = n\p; p = nextprime(1+p)); (m); };
%Y A328572 Cf. A003557, A051903, A085731, A276086, A327860, A328114, A328475, A328571, A328573, A328575, A328577.
%K A328572 nonn,look
%O A328572 0,5
%A A328572 _Antti Karttunen_, Oct 20 2019