|
|
A070858
|
|
Smallest prime == 1 mod L, where L = LCM of 1 to n.
|
|
6
|
|
|
2, 3, 7, 13, 61, 61, 421, 2521, 2521, 2521, 55441, 55441, 4324321, 4324321, 4324321, 4324321, 85765681, 85765681, 232792561, 232792561, 232792561, 232792561, 10708457761, 10708457761, 26771144401, 26771144401, 401567166001
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Beginning with 3, smallest prime p = a(n) such that p + k is divisible by k + 1 for each k = 1, 2, ..., n. For example: 61 --> 62, 63, 64, 65 and 66 are divisible respectively by 2, 3, 4, 5 and 6. - Robin Garcia, Jul 23 2012
|
|
LINKS
|
|
|
MAPLE
|
local l, p;
l := ilcm(seq(i, i=1..n)) ;
for p from 1 by l do
if isprime(p) then
return p;
end if;
end do:
|
|
PROG
|
(PARI) a(n)=my(L=lcm(vector(n, i, i)), k=1); while(!ispseudoprime(k+=L), ); k \\ Charles R Greathouse IV, Jun 25 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|