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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275629 The least odd prime leaving a prime remainder when divided by each of the first n odd primes. 1
 5, 17, 17, 47, 863, 863, 887, 887, 887, 887, 133877, 858707, 886013, 11891003, 11891003, 324840323, 1364103977, 7151489963, 7151489963, 10402068437, 10402068437, 875858298023, 7859437730303, 7859437730303, 10784807012723, 304858842631367, 1939577853386297, 4237718864973557 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Bert Dobbelaere, Table of n, a(n) for n = 1..36 J. M. Bergot (Proposer), The least odd prime leaving prime remainder when divided by the first nn odd primes, Math Stack Exchange, 2016. EXAMPLE 47 mod 3,5,7,11 is 2,2,5,3, which are all primes. PROG (Perl) use ntheory ":all"; sub a275629 { my(\$n)=@_; my \$it=prime_iterator(3); my @fnp = map { \$it->() } 1..\$n; while (1) { \$p=\$it->(); return \$p if vecall {is_prime(\$p%\$_)} @fnp; } } say a275629(\$_) for 1..20; # Dana Jacobsen, Aug 09 2016 CROSSREFS Sequence in context: A305248 A231710 A316548 * A249589 A040153 A038896 Adjacent sequences:  A275626 A275627 A275628 * A275630 A275631 A275632 KEYWORD nonn AUTHOR N. J. A. Sloane, Aug 07 2016 EXTENSIONS Corrected and extended by Dana Jacobsen, Aug 09 2016 a(22) onwards from Bert Dobbelaere, Sep 13 2019 STATUS approved

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

Last modified January 21 01:45 EST 2022. Contains 350473 sequences. (Running on oeis4.)