login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A066607
a(n) = 3^n mod n^3.
3
0, 1, 0, 17, 118, 81, 129, 417, 0, 49, 124, 945, 1498, 177, 1782, 1857, 1958, 729, 3917, 401, 7398, 8721, 6466, 4833, 68, 14049, 0, 3889, 9718, 26649, 24648, 16001, 3294, 6537, 32457, 41553, 34857, 33601, 26703, 32801, 9310, 62721, 76070, 50417, 12393
OFFSET
1,4
LINKS
EXAMPLE
a(7) = 129 as 3^7 = 2187 = (7^3)*6 + 129.
MATHEMATICA
Table[ Mod[ 3^n, n^3], {n, 1, 50} ]
PROG
(Sage) [power_mod(3, n, n^3)for n in range(1, 46)] # Zerinvary Lajos, Nov 28 2009
(PARI) a(n) = { lift(Mod(3, n^3)^n) } \\ Harry J. Smith, Mar 10 2010
CROSSREFS
Cf. A066606.
Sequence in context: A056117 A196575 A003109 * A083200 A102353 A289663
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, Dec 22 2001
EXTENSIONS
More terms from Floor van Lamoen and Robert G. Wilson v, Dec 23 2001
STATUS
approved