login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Cf. A002110 (primorials), A073915, A103783, A214089.
Cf. A076689 (values of k).
Sequence in context: A093441 A087864 A066676 * A030521 A105767 A063896
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 18 2002
EXTENSIONS
More terms from Vladeta Jovovic, Aug 20 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 12:37 EDT 2024. Contains 372243 sequences. (Running on oeis4.)