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 A294875 #15 Nov 13 2017 13:22:28 %S A294875 1,1,1,2,1,1,1,6,2,1,1,2,1,1,1,30,1,2,1,2,1,1,1,6,2,1,6,2,1,1,1,210,1, %T A294875 1,1,8,1,1,1,6,1,1,1,2,2,1,1,30,2,2,1,2,1,6,1,6,1,1,1,2,1,1,2,2310,1, %U A294875 1,1,2,1,1,1,24,1,1,2,2,1,1,1,30,30,1,1,2,1,1,1,6,1,2,1,2,1,1,1,210,1,2,2,8,1,1,1,6,1,1,1,24,1,1,1,30,1,1,1,2 %N A294875 a(n) = Product_{d|n, d = x^k, with x,k > 1} prime(A052409(d)-1). %C A294875 For all i, j: %C A294875 a(i) = a(j) => A294874(i) = A294874(j) => A046951(i) = A046951(j). %C A294875 a(i) = a(j) => A061704(i) = A061704(j). %H A294875 Antti Karttunen, <a href="/A294875/b294875.txt">Table of n, a(n) for n = 1..65537</a> %H A294875 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A294875 a(n) = Product_{d|n, d>1} A008578(A052409(d)). %F A294875 a(n) = A064989(A293524(n)). %F A294875 Other identities. For all n >= 1: %F A294875 1 + A001222(a(n)) = A091050(n). %o A294875 (PARI) A294875(n) = { my(m=1,e); fordiv(n,d, if(d>1, e = ispower(d); if(e>1, m *= prime(e-1)))); m; }; %Y A294875 Cf. A000040, A001597, A052409. %Y A294875 Cf. A293524, A294873, A294874. %Y A294875 Cf. A046951, A061704, A091050 (some of the matched sequences). %K A294875 nonn %O A294875 1,4 %A A294875 _Antti Karttunen_, Nov 11 2017