|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|