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 A294873 #10 Nov 13 2017 13:22:08
%S A294873 1,2,2,2,2,8,2,6,2,8,2,16,2,8,8,6,2,16,2,16,8,8,2,96,2,8,6,16,2,128,2,
%T A294873 30,8,8,8,32,2,8,8,96,2,128,2,16,16,8,2,192,2,16,8,16,2,96,8,96,8,8,2,
%U A294873 1024,2,8,16,30,8,128,2,16,8,128,2,384,2,8,16,16,8,128,2,192,6,8,2,1024,8,8,8,96,2,1024,8,16,8,8,8,1920,2,16,16,32,2,128,2
%N A294873 a(n) = Product_{d|n, d>1, d = x^(2k-1) for some maximal k >= 1} prime(k).
%H A294873 Antti Karttunen, <a href="/A294873/b294873.txt">Table of n, a(n) for n = 1..65537</a>
%H A294873 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A294873 a(n) = Product_{d|n, d>1, r = A052409(d) is odd} A000040((r+1)/2).
%F A294873 Other identities. For all n >= 1:
%F A294873 A001222(a(n)) = A056595(n).
%F A294873 A007814(a(n)) = A183096(n).
%o A294873 (PARI) A294873(n) = { my(m=1,e); fordiv(n,d, if(d>1, e = ispower(d); if(!e, m += m, if((e>1)&&(e%2), m *= prime((e+1)/2))))); m; };
%Y A294873 Cf. A000040, A056595, A052409, A183096.
%Y A294873 Cf. A293524, A294874, A294875.
%K A294873 nonn
%O A294873 1,2
%A A294873 _Antti Karttunen_, Nov 11 2017