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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118537 Number of functions f: {1, 2, ..., n} --> {1, 2, ..., n} such that f(1) != f(2), f(2) != f(3), ..., f(n-1) != f(n), f(n) != f(1). 2
2, 6, 84, 1020, 15630, 279930, 5764808, 134217720, 3486784410, 99999999990, 3138428376732, 106993205379060, 3937376385699302, 155568095557812210, 6568408355712890640, 295147905179352825840, 14063084452067724991026 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

a(n) is also the number of circuits of length n in the complete graph on n vertices. [From Thibaut Lienart (syncthib(AT)gmail.com), Jan 29 2010]

FORMULA

a(n) = (n-1)^n + (-1)^n*(n-1).

CROSSREFS

Cf. A055897.

Sequence in context: A076146 A114552 A055706 * A109892 A055702 A179214

Adjacent sequences:  A118534 A118535 A118536 * A118538 A118539 A118540

KEYWORD

nonn

AUTHOR

Warut Roonguthai (warut822(AT)yahoo.com), May 06 2006

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 16 17:48 EST 2012. Contains 205939 sequences.