Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075089
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075089 Smallest prime == 1 mod n-th composite number. +0
3
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; listen)
OFFSET

1,1

PROGRAM

(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: A064944 A070372 A082818 this_sequence A075305 A140564 A078764

Adjacent sequences: A075086 A075087 A075088 this_sequence A075090 A075091 A075092

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 13 2002

EXTENSIONS

More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 20 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research