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
 0, 0, 64, 0, 399, 208, 1978, 0, 6265, 8576, 6978, 1792, 19075, 22864, 36199, 0, 17089, 87616, 31867, 107776, 83791, 142928, 195688, 225280, 201999, 302656, 362152, 304896, 401393, 546976, 612688, 0, 226279, 629152, 399674, 718336, 1132463 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 EXAMPLE a(7) = 1978 as 4^7 = 16384 = (7^4)*6 + 1978. MATHEMATICA Table[ Mod[ 4^n, n^4], {n, 1, 50} ] Table[PowerMod[4, n, n^4], {n, 50}] (* Harvey P. Dale, Aug 25 2023 *) PROG (PARI) { for (n=1, 1000, write("b066608.txt", n, " ", 4^n % n^4) ) } \\ Harry J. Smith, Mar 11 2010 CROSSREFS Sequence in context: A010112 A058963 A243775 * A247067 A221761 A085339 Adjacent sequences: A066605 A066606 A066607 * A066609 A066610 A066611 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 12 04:50 EDT 2024. Contains 375085 sequences. (Running on oeis4.)