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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A086507 If n is even, a(n) = smallest prime == 1 (mod n), If n is odd, a(n) = smallest prime == -1 (mod n). 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 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 CROSSREFS Cf. A034694, A038700, A086508. Sequence in context: A010242 A339645 A318956 * A133568 A120716 A084318 Adjacent sequences: A086504 A086505 A086506 * A086508 A086509 A086510 KEYWORD nonn AUTHOR Amarnath Murthy, Jul 29 2003 EXTENSIONS More terms from David Wasserman, Mar 09 2005 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.

Last modified February 8 11:05 EST 2023. Contains 360138 sequences. (Running on oeis4.)