OFFSET
1,1
COMMENTS
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.
Smallest prime p such that the prime factorization of p-1 contains the first n primes. - R. J. Mathar, Jul 03 2012
LINKS
T. D. Noe, Table of n, a(n) for n = 1..150
PROG
(PARI) a(n)=if(n<0, 0, s=1; while(prime(s)%prod(i=1, n, prime(i))>1, s++); s)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 18 2002
EXTENSIONS
More terms from Vladeta Jovovic, Aug 20 2002
STATUS
approved