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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096385 a(n) = smallest prime p with p^n mod n = 1. 0
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; refs; listen; history; internal format)
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 * A205723 A088837 A201385

Adjacent sequences:  A096382 A096383 A096384 * A096386 A096387 A096388

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.