The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A187751 n^(n!) mod (n!)^n. 2
 0, 0, 0, 81, 225280, 7991790625, 1078848154238976, 65180706714634067542224001, 1650157594512930366268925848349310976, 66807065275536807794426016376688705273224158387201 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Table of n, a(n) for n=0..9. FORMULA a(n) = A053986(n) mod A036740(n). EXAMPLE a(3) = 3^6 mod 6^3 = 729 mod 216 = 81. PROG (Python) import math for n in range(12): f = math.factorial(n) print (n**f) % (f**n), (Maxima) A187751(n):=mod(n^(n!), (n!)^n)\$ makelist(A187751(n), n, 0, 9); /* Martin Ettl, Jan 13 2013 */ CROSSREFS Cf. A053986, A036740. Sequence in context: A145261 A013745 A093227 * A285997 A143675 A033435 Adjacent sequences: A187748 A187749 A187750 * A187752 A187753 A187754 KEYWORD nonn AUTHOR Alex Ratushnyak, Jan 03 2013 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 May 29 00:29 EDT 2024. Contains 372921 sequences. (Running on oeis4.)