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 A293515 #11 Nov 13 2017 13:21:47
%S A293515 1,1,1,2,1,1,1,3,2,1,1,2,1,1,1,10,1,2,1,2,1,1,1,3,2,1,3,2,1,1,1,14,1,
%T A293515 1,1,8,1,1,1,3,1,1,1,2,2,1,1,10,2,2,1,2,1,3,1,3,1,1,1,2,1,1,2,66,1,1,
%U A293515 1,2,1,1,1,12,1,1,2,2,1,1,1,10,10,1,1,2,1,1,1,3,1,2,1,2,1,1,1,14,1,2,2,8,1,1,1,3,1,1,1,12,1,1,1,10,1,1,1,2,2
%N A293515 a(n) = Product_{d^k|n, d>1, k>1} prime(A286561(n,d)-1), where A286561(n,d) gives the highest exponent of d dividing n.
%H A293515 Antti Karttunen, <a href="/A293515/b293515.txt">Table of n, a(n) for n = 1..65537</a>
%H A293515 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A293515 a(n) = Product_{d|n, d>1} A008578(A286561(n,d)).
%F A293515 a(n) = A064989(A293514(n)).
%F A293515 Other identities. For all n >= 1:
%F A293515 1 + A001222(a(n)) = A046951(n).
%o A293515 (PARI) A293515(n) = { my(m=1,v); fordiv(n,d,if(d>1, v = valuation(n,d); if(v>1, m *= prime(v-1)))); m; };
%Y A293515 Cf. A000040, A008578, A286561.
%Y A293515 Cf. A293514, A294875.
%Y A293515 Cf. A046951.
%K A293515 nonn
%O A293515 1,4
%A A293515 _Antti Karttunen_, Nov 11 2017