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!)
A066607 a(n) = 3^n mod n^3. 3

%I #13 Dec 07 2019 12:18:22

%S 0,1,0,17,118,81,129,417,0,49,124,945,1498,177,1782,1857,1958,729,

%T 3917,401,7398,8721,6466,4833,68,14049,0,3889,9718,26649,24648,16001,

%U 3294,6537,32457,41553,34857,33601,26703,32801,9310,62721,76070,50417,12393

%N a(n) = 3^n mod n^3.

%H Harry J. Smith, <a href="/A066607/b066607.txt">Table of n, a(n) for n = 1..1000</a>

%e a(7) = 129 as 3^7 = 2187 = (7^3)*6 + 129.

%t Table[ Mod[ 3^n, n^3], {n, 1, 50} ]

%o (Sage) [power_mod(3,n,n^3)for n in range(1,46)] # _Zerinvary Lajos_, Nov 28 2009

%o (PARI) { for (n=1, 1000, write("b066607.txt", n, " ", 3^n % n^3) ) } \\ _Harry J. Smith_, Mar 10 2010

%K easy,nonn

%O 1,4

%A _Amarnath Murthy_, Dec 22 2001

%E More terms from _Floor van Lamoen_ and _Robert G. Wilson v_, Dec 23 2001

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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)