login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075089 Smallest prime == 1 mod n-th composite number. 2
5, 7, 17, 19, 11, 13, 29, 31, 17, 19, 41, 43, 23, 73, 101, 53, 109, 29, 31, 97, 67, 103, 71, 37, 191, 79, 41, 43, 89, 181, 47, 97, 197, 101, 103, 53, 109, 331, 113, 229, 59, 61, 311, 127, 193, 131, 67, 137, 139, 71, 73, 149, 151, 229, 463, 79, 241, 163, 83, 337 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..60.

PROG

(PARI) n=1:v=vector(100, k, n=n+1:while(isprime(n), n=n+1):n):for(l=1, 100, forprime(p=2, 10000, if((p%v[l])==1, print1(p", "):break)))

CROSSREFS

Sequence in context: A070372 A082818 A224070 * A075305 A140564 A253085

Adjacent sequences:  A075086 A075087 A075088 * A075090 A075091 A075092

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Sep 13 2002

EXTENSIONS

More terms from Ralf Stephan, Mar 20 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 12:28 EST 2019. Contains 329370 sequences. (Running on oeis4.)