Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096385
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096385 a(n) = smallest prime p with p^n mod n = 1. +0
1
3, 7, 3, 11, 5, 29, 3, 7, 11, 23, 5, 53, 13, 31, 3, 103, 5, 191, 3, 37, 23, 47, 5, 11, 53, 7, 13, 59, 11, 311, 3, 67, 67, 71, 5, 149, 37, 61, 3, 83, 5, 173, 23, 31, 47, 283, 5, 29, 11, 103, 5, 107, 5, 31, 13, 7, 59, 709, 7, 367, 61, 37, 3, 131, 23, 269, 13, 139, 29, 569 (list; graph; listen)
OFFSET

2,1

EXAMPLE

n=5: 2^5=32=5*6+2, 3^5=243=5*48+3, 5^5 mod 5 = 0,

7^5=16807=5*3361+2, 11^5=161051=5*32210+1: a(5)=11.

CROSSREFS

Cf. A015910, A066601.

Sequence in context: A074176 A005596 A159566 this_sequence A088837 A019158 A086153

Adjacent sequences: A096382 A096383 A096384 this_sequence A096386 A096387 A096388

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 05 2004

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research