cp's OEIS Frontend

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.

A304102 a(n) = Product_{d|n, d prime(A304101(d)-1).

This page as a plain text file.
%I A304102 #14 Jun 07 2018 22:12:41
%S A304102 1,2,2,4,2,8,2,12,4,8,2,120,2,12,8,24,2,200,2,120,12,12,2,1680,4,8,20,
%T A304102 180,2,2000,2,120,12,44,12,12600,2,44,8,1680,2,1200,2,180,200,20,2,
%U A304102 42000,6,440,44,120,2,7800,12,3960,44,12,2,3234000,2,44,120,840,8,10200,2,264,20,3000,2,630000,2,20,440,1452,18,2000,2,109200,260,44,2,1386000
%N A304102 a(n) = Product_{d|n, d<n} prime(A304101(d)-1).
%H A304102 Antti Karttunen, <a href="/A304102/b304102.txt">Table of n, a(n) for n = 1..4181</a>
%F A304102 a(n) = Product_{d|n, d<n} A000040(A304101(d)-1).
%F A304102 a(n) = 2*A304104(n) / A000040(A304101(n)-1).
%F A304102 Other identities. For all n >= 1:
%F A304102 A001222(a(n)) = A032741(n).
%F A304102 A007814(a(n)) = A293435(n).
%F A304102 A007949(a(n)) = A304095(n).
%o A304102 (PARI)
%o A304102 \\ Needs also code from A304101:
%o A304102 A304102(n) = { my(m=1); fordiv(n,d,if(d<n, m *= prime(A304101(d)-1))); (m); };
%Y A304102 Cf. A304101, A304103 (restricted growth sequence transform of this sequence), A304104.
%K A304102 nonn
%O A304102 1,2
%A A304102 _Antti Karttunen_, May 13 2018