The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066608 a(n) = 4^n mod n^4. 1

%I #12 Aug 25 2023 18:32:24

%S 0,0,64,0,399,208,1978,0,6265,8576,6978,1792,19075,22864,36199,0,

%T 17089,87616,31867,107776,83791,142928,195688,225280,201999,302656,

%U 362152,304896,401393,546976,612688,0,226279,629152,399674,718336,1132463

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

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

%e a(7) = 1978 as 4^7 = 16384 = (7^4)*6 + 1978.

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

%t Table[PowerMod[4,n,n^4],{n,50}] (* _Harvey P. Dale_, Aug 25 2023 *)

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

%K easy,nonn

%O 1,3

%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.

Last modified September 12 09:33 EDT 2024. Contains 375850 sequences. (Running on oeis4.)