A086507 If n is even, a(n) = smallest prime == 1 (mod n), If n is odd, a(n) = smallest prime == -1 (mod n).

2, 3, 2, 5, 19, 7, 13, 17, 17, 11, 43, 13, 103, 29, 29, 17, 67, 19, 37, 41, 41, 23, 137, 73, 149, 53, 53, 29, 173, 31, 61, 97, 131, 103, 139, 37, 73, 191, 233, 41, 163, 43, 257, 89, 89, 47, 281, 97, 97, 101, 101, 53, 211, 109, 109, 113, 113, 59, 353, 61, 487, 311, 251

Offset: 1

Author

Amarnath Murthy, Jul 29 2003

Keywords

• nonn

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A034694, A038700, A086508.

Programs

Maple

f:= proc(n) local x;
if n::even then x:= 1 else x:= -1; fi;
do
  x:= x+n;
  if isprime(x) then return x fi
od
end proc:
map(f, [$1..100]); # Robert Israel, Dec 09 2020

Extensions

More terms from David Wasserman, Mar 09 2005