The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A254570 The number of unordered pairs (f,g) of functions from {1..n} to itself such that fg=gf (i.e., f(g(i))=g(f(i)) for all i) where f and g are distinct. 2
 0, 3, 57, 1284, 34220, 1098720, 41579328, 1832244288, 92830006368, 5353120671120, 348383876993900, 25409389391925264, 2064511110000765192, 185885772163424273304, 18458953746901624026000, 2012589235930543617012480, 239897773975844015012351360, 31132547318002718989156350240, 4380969784826872849927354999092, 665896601825393760478978112600400 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = (A181162(n) - n^n)/2. EXAMPLE The a(2) = 3 pairs of maps [2] -> [2] are: 01: [ 1 1 ] [ 1 2 ] 02: [ 1 2 ] [ 2 1 ] 03: [ 1 2 ] [ 2 2 ] CROSSREFS Cf. A181162 (ordered pairs), A254569 (unordered pairs). Sequence in context: A157929 A053725 A053774 * A308404 A009723 A069992 Adjacent sequences: A254567 A254568 A254569 * A254571 A254572 A254573 KEYWORD nonn AUTHOR Joerg Arndt, Feb 01 2015 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 February 1 06:22 EST 2023. Contains 359981 sequences. (Running on oeis4.)