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 A328575 #9 Oct 20 2019 21:46:03
%S A328575 1,1,1,1,1,3,1,1,1,1,1,3,1,5,5,5,5,15,5,25,25,25,25,75,25,125,125,125,
%T A328575 125,375,1,1,1,1,1,3,1,1,1,1,1,3,1,5,5,5,5,15,5,25,25,25,25,75,25,125,
%U A328575 125,125,125,375,1,7,7,7,7,21,7,7,7,7,7,21,7,35,35,35,35,105,35,175,175,175,175,525,175,875,875,875,875,2625,7
%N A328575 a(n) = A003557(A032742(A276086(n))).
%H A328575 Antti Karttunen, <a href="/A328575/b328575.txt">Table of n, a(n) for n = 0..2310</a>
%H A328575 Antti Karttunen, <a href="/A328575/a328575.txt">Data supplement: n, a(n) computed for n = 0..32768</a>
%H A328575 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328575 a(n) = A003557(A032742(A276086(n))).
%F A328575 For n >= 1, a(n) = A003557(A276086(A276151(n))).
%F A328575 For n >= 1, max(A276088(n),1+A051903(a(n))) = A328114(n).
%o A328575 (PARI)
%o A328575 A003557(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557
%o A328575 A032742(n) = if(1==n,n,n/vecmin(factor(n)[,1]));
%o A328575 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328575 A328575(n) = A003557(A032742(A276086(n)));
%Y A328575 Cf. A003557, A032742, A051903, A276086, A276088, A328114, A328572, A328576.
%K A328575 nonn
%O A328575 0,6
%A A328575 _Antti Karttunen_, Oct 20 2019