login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064546 Remainder when (n!)^2 is divided by n^n. 1
0, 0, 9, 64, 1900, 5184, 695310, 15089664, 346348629, 8189440000, 170553548176, 4519967588352, 202522159449675, 8500218417954816, 265594041953296875, 3543051899458551808, 454740628232312103872, 5853583711033675481088 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

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

FORMULA

a(n)= (n!)^2 mod n^n

EXAMPLE

a(5) = 1900 because (5!)^2 = 14400 = 1900 (mod 5^5=3125).

PROG

(PARI) { for (n=1, 100, write("b064546.txt", n, " ", (n!)^2 % n^n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 18 2009]

CROSSREFS

Cf. A063709.

Sequence in context: A037484 A013566 A056769 * A067961 A104127 A043426

Adjacent sequences:  A064543 A064544 A064545 * A064547 A064548 A064549

KEYWORD

easy,nonn

AUTHOR

Floor van Lamoen (fvlamoen(AT)hotmail.com), Oct 09 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.