Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118537
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
2, 6, 84, 1020, 15630, 279930, 5764808, 134217720, 3486784410, 99999999990, 3138428376732, 106993205379060, 3937376385699302, 155568095557812210, 6568408355712890640, 295147905179352825840, 14063084452067724991026 (list; graph; listen)
OFFSET

2,1

FORMULA

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

CROSSREFS

Cf. A055897.

Sequence in context: A076146 A114552 A055706 this_sequence A109892 A055702 A128265

Adjacent sequences: A118534 A118535 A118536 this_sequence A118538 A118539 A118540

KEYWORD

nonn

AUTHOR

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

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research