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 A293524 #9 Nov 13 2017 13:21:57
%S A293524 1,2,2,6,2,8,2,30,6,8,2,48,2,8,8,210,2,48,2,48,8,8,2,480,6,8,30,48,2,
%T A293524 128,2,2310,8,8,8,864,2,8,8,480,2,128,2,48,48,8,2,6720,6,48,8,48,2,
%U A293524 480,8,480,8,8,2,3072,2,8,48,30030,8,128,2,48,8,128,2,17280,2,8,48,48,8,128,2,6720,210,8,2,3072,8,8,8,480
%N A293524 a(n) = Product_{d|n, d>1} prime(A052409(d)).
%H A293524 Antti Karttunen, <a href="/A293524/b293524.txt">Table of n, a(n) for n = 1..16384</a>
%H A293524 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A293524 a(n) = Product_{d|n, d>1} A000040(A052409(d)).
%F A293524 Other identities. For all n >= 1:
%F A293524 A001222(a(n)) = A032741(n).
%F A293524 A007814(a(n)) = A183096(n).
%F A293524 A064989(a(n)) = A294875(n).
%o A293524 (PARI) A293524(n) = { my(m=1,e); fordiv(n,d, if(d>1, e = ispower(d); if(!e, m += m, m *= prime(e)))); m; };
%Y A293524 Cf. A000040, A052409, A294873, A294874, A294875.
%Y A293524 Cf. also A293514, A293442.
%K A293524 nonn
%O A293524 1,2
%A A293524 _Antti Karttunen_, Nov 11 2017