|
|
A073917
|
|
Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.
|
|
9
|
|
|
3, 7, 31, 211, 2311, 120121, 4084081, 106696591, 892371481, 71166625531, 200560490131, 29682952539241, 2129751844690471, 78496567990020181, 8608456956238879741, 97767475431570134191, 9613801750771063195351
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
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
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|