login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116609 a(n) = 13^n modulo n. 21
0, 1, 1, 1, 3, 1, 6, 1, 1, 9, 2, 1, 0, 1, 7, 1, 13, 1, 13, 1, 13, 15, 13, 1, 18, 13, 1, 1, 13, 19, 13, 1, 19, 33, 27, 1, 13, 17, 13, 1, 13, 1, 13, 5, 28, 31, 13, 1, 48, 49, 4, 13, 13, 1, 32, 1, 31, 53, 13, 1, 13, 45, 55, 1, 13, 31, 13, 1, 58, 29, 13, 1, 13, 21, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Paul Tek, Table of n, a(n) for n = 1..10000

EXAMPLE

a(5)=3 because 13^5 = 371293 = 3 mod 5.

MATHEMATICA

Table[PowerMod[13, k, k], {k, 200}]

PROG

(PARI) for(n=1, 50, print1(lift(Mod(13^n, n)), ", ")) \\ G. C. Greubel, Oct 28 2017

CROSSREFS

Sequence in context: A301333 A347231 A213670 * A124846 A177375 A099512

Adjacent sequences:  A116606 A116607 A116608 * A116610 A116611 A116612

KEYWORD

nonn

AUTHOR

Zak Seidov, Feb 19 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 08:43 EDT 2022. Contains 356993 sequences. (Running on oeis4.)