login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

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) { for (n=1, 1000, write("b066607.txt", n, " ", 3^n % n^3) ) } \\ Harry J. Smith, Mar 10 2010

CROSSREFS

Sequence in context: A056117 A196575 A003109 * A083200 A102353 A289663

Adjacent sequences:  A066604 A066605 A066606 * A066608 A066609 A066610

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 20:03 EDT 2020. Contains 335652 sequences. (Running on oeis4.)