Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063709
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063709 Remainder when n^n is divided by n!. +0
2
0, 0, 0, 3, 16, 5, 576, 2023, 4096, 227529, 2656000, 26301011, 443667456, 5268921853, 294332416, 820814907375, 19909425135616, 225992064764177, 5838869363687424, 43054524724611979, 296380418621440000 (list; graph; listen)
OFFSET

0,4

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

EXAMPLE

a(7) = 2023 because 7^7 = 2023 (mod 7!)

MATHEMATICA

Table[PowerMod[n, n, n! ], {n, 24}]

PROGRAM

(PARI) for(n=0, 22, print(Mod(n^n, n!)))

(PARI) { for (n=0, 100, write("b063709.txt", n, " ", n^n % n!) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 28 2009]

CROSSREFS

Sequence in context: A165969 A098373 A054793 this_sequence A076623 A068516 A032922

Adjacent sequences: A063706 A063707 A063708 this_sequence A063710 A063711 A063712

KEYWORD

easy,nonn

AUTHOR

Axel Harvey (ax(AT)hirsig.ca), Aug 23 2001

EXTENSIONS

Corrected and extended by a number of contributors, Aug 24, 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research