Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163952
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163952 The number of functions in a finite set for which the sequence of composition powers ends in a length 3 cycle. +0
2
0, 0, 2, 32, 480, 7880, 145320 (list; graph; listen)
OFFSET

1,3

COMMENT

See A163951 for the cases ending with length 2 cycles and fixed points.

EXAMPLE

Any period 3 permutation (or disjoint combinations) is one element to be counted. This starts with n=3, where there are only 2 cases:

f1:{1,2,3}->{2,3,1} and f2:{1,2,3}->{3,1,2}

but for n>3 there are other elements (non permutations) to be counted

(for instance, with n=5, we count with f:{1,2,3,4,5}->{2,4,5,3,4}).

CROSSREFS

Cf. A163951, A163947, A163859.

Sequence in context: A127697 A109772 A115418 this_sequence A022028 A013776 A022019

Adjacent sequences: A163949 A163950 A163951 this_sequence A163953 A163954 A163955

KEYWORD

more,nonn

AUTHOR

Carlos Alves (cjsalves(AT)gmail.com), Aug 07 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research