|
Search: id:A073917
|
|
|
| A073917 |
|
Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e. when divided by first n primes. |
|
+0
2
|
|
| 3, 7, 31, 211, 2311, 120121, 4084081, 106696591, 892371481, 71166625531, 200560490131, 29682952539241, 2129751844690471, 78496567990020181, 8608456956238879741, 97767475431570134191, 9613801750771063195351
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, s=1; while(prime(s)%prod(i=1, n, prime(i))>1, s++); s)
|
|
CROSSREFS
|
Cf. A073915.
Adjacent sequences: A073914 A073915 A073916 this_sequence A073918 A073919 A073920
Sequence in context: A093441 A087864 A066676 this_sequence A030521 A105767 A063896
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 18 2002
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 20 2002
|
|
|
Search completed in 0.002 seconds
|
