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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066607 3^n mod n^3. 1
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; 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

(Other) sage: [power_mod(3, n, n^3)for n in xrange(1, 46)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 28 2009]

(PARI) { for (n=1, 1000, write("b066607.txt", n, " ", 3^n % n^3) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 10 2010]

CROSSREFS

Sequence in context: A056117 A196575 A003109 * A083200 A102353 A048714

Adjacent sequences:  A066604 A066605 A066606 * A066608 A066609 A066610

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 22 2001

EXTENSIONS

More terms from Floor van Lamoen (fvlamoen(AT)hotmail.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 23 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:21 EST 2012. Contains 205860 sequences.