|
%I #14 Jul 30 2017 03:45:34
%S 3,7,31,211,2311,120121,4084081,106696591,892371481,71166625531,
%T 200560490131,29682952539241,2129751844690471,78496567990020181,
%U 8608456956238879741,97767475431570134191,9613801750771063195351
%N Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.
%C Let Pr(n) = the product of first n primes. Then a(n) is the smallest prime of the form k*Pr(n) + 1. k = 1 for first five terms.
%C Smallest prime p such that the prime factorization of p-1 contains the first n primes. - _R. J. Mathar_, Jul 03 2012
%H T. D. Noe, <a href="/A073917/b073917.txt">Table of n, a(n) for n = 1..150</a>
%o (PARI) a(n)=if(n<0,0,s=1; while(prime(s)%prod(i=1,n, prime(i))>1,s++); s)
%Y Cf. A002110 (primorials), A073915, A103783, A214089.
%Y Cf. A076689 (values of k).
%K nonn
%O 1,1
%A _Amarnath Murthy_, Aug 18 2002
%E More terms from _Vladeta Jovovic_, Aug 20 2002
|
