A066601 a(n) = 3^n mod n.

0, 1, 0, 1, 3, 3, 3, 1, 0, 9, 3, 9, 3, 9, 12, 1, 3, 9, 3, 1, 6, 9, 3, 9, 18, 9, 0, 25, 3, 9, 3, 1, 27, 9, 12, 9, 3, 9, 27, 1, 3, 15, 3, 37, 18, 9, 3, 33, 31, 49, 27, 29, 3, 27, 12, 9, 27, 9, 3, 21, 3, 9, 27, 1, 48, 3, 3, 13, 27, 39, 3, 9, 3, 9, 57

Offset: 1

Author

Amarnath Murthy, Dec 22 2001

Keywords

• base
• easy
• nonn

Examples

			a(7) = 3 as 3^7 = 2187 = 7*312 + 3.
		

Links

• Harry J. Smith and Seiichi Manyama, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith)

Crossrefs

Cf. k^n mod n: A015910 (k=2), this sequence (k=3), A066602 (k=4), A066603 (k=5), A066604 (k=6), A066438 (k=7), A066439 (k=8), A066440 (k=9), A056969 (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13).

Programs

Maple

seq(irem(3^n,n),n=1..75); # Zerinvary Lajos, Apr 20 2008

Mathematica

Table[PowerMod[3, n, n], {n, 75}]

PARI

a(n) = { lift(Mod(3, n)^n) } \\ Harry J. Smith, Mar 09 2010

Python

def A066601(n): return pow(3,n,n) # Chai Wah Wu, Aug 24 2023

Extensions

More terms from Robert G. Wilson v, Dec 27 2001