Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162682 If S is countable finite set, we can define n as number of elements in S. There are n^n distinct functions f(S)->S. Each function has a fixed point, or an orbit in S. This sequence is a number of distinct functions g(S)->S, with largest orbit. +0
1
1, 1, 2, 6, 20, 840, 420, 2688, 18144 (list; graph; listen)
OFFSET

1,3

COMMENT

Sizes of orbits are given by A000793.

EXAMPLE

For S={a}, n=1 and only one operation possible {a->a}. For S={a,b}, n=2 and possible operations are {a->a,b->a}, {a->a,b->b}, {a->b,b->a},{a->b,b->b}. Longest orbit generated by applying operation {a->b,b->a}: initial set (a,b), applying function gives orbit - (b,a), (a,b). All other possible functions are generating fixed points.

CROSSREFS

Sequence in context: A082690 A104861 A074859 this_sequence A103160 A126099 A063753

Adjacent sequences: A162679 A162680 A162681 this_sequence A162683 A162684 A162685

KEYWORD

nonn

AUTHOR

Dmitriy Samsonov (dmitriy.samsonov(AT)gmail.com), Jul 10 2009

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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research