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 A304104 #11 May 13 2018 20:44:21
%S A304104 1,2,2,6,2,20,3,12,10,20,3,420,2,30,20,60,11,300,11,420,12,30,5,4200,
%T A304104 22,20,130,990,3,11000,11,420,102,44,30,31500,5,242,20,10920,11,3000,
%U A304104 13,1170,1100,190,3,231000,33,2420,506,420,19,66300,12,9900,110,30,11,8085000,13,242,300,5460,52,56100,19,660,130,19500,13,9135000,11,290,4180,2178,99
%N A304104 a(n) = Product_{d|n, d>1} prime(A304101(d)-1).
%H A304104 Antti Karttunen, <a href="/A304104/b304104.txt">Table of n, a(n) for n = 1..4181</a>
%F A304104 a(n) = Product_{d|n, d>1} A000040(A304101(d)-1).
%F A304104 a(n) = (1/2) * A304102(n) * A000040(A304101(n)-1).
%F A304104 Other identities. For all n >= 1:
%F A304104 A001222(a(n)) = A032741(n).
%F A304104 A001511(a(n)) = A005086(n).
%F A304104 A007949(a(n)) = A304096(n).
%o A304104 (PARI)
%o A304104 \\ Needs also code from A304101:
%o A304104 A304104(n) = { my(m=1); fordiv(n,d,if(d>1, m *= prime(A304101(d)-1))); (m); };
%Y A304104 Cf. A304101, A304102, A304105 (restricted growth sequence transform of this sequence).
%K A304104 nonn
%O A304104 1,2
%A A304104 _Antti Karttunen_, May 13 2018