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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117131 Remainder when n^n is divided by the n-th prime number. 1
1, 1, 2, 4, 1, 12, 12, 7, 2, 6, 24, 26, 11, 6, 30, 15, 9, 41, 39, 32, 51, 64, 78, 4, 72, 43, 89, 25, 31, 109, 26, 62, 80, 36, 9, 72, 132, 140, 105, 52, 132, 135, 117, 147, 79, 193, 93, 49, 175, 76, 64, 187, 196, 9, 163, 221, 190, 62, 102, 280, 71, 87, 102, 268 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = mod(n^n, prime(n)).

EXAMPLE

a(8)=7 because 8^8 is 16777216, the 8th prime is 19 and 16777216 modulo 19 is 7.

MATHEMATICA

Table[PowerMod[n, n, Prime[n]], {n, 100}] (* T. D. Noe, Aug 20 2013 *)

CROSSREFS

Cf. A000312, A069547.

Sequence in context: A124503 A114499 A030730 * A204117 A184176 A163546

Adjacent sequences:  A117128 A117129 A117130 * A117132 A117133 A117134

KEYWORD

easy,nonn

AUTHOR

Axel Harvey, Jul 23 2006

EXTENSIONS

More terms from Franklin T. Adams-Watters, Jul 26 2006

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 00:45 EST 2016. Contains 278959 sequences.