TITLE: Which finite groups are not the automorphism group of some rooted finite tree?
QUESTION [10 upvotes]: The question is as given in the title:

Which finite groups are not the automorphism group of some rooted finite tree?

A rephrasing could be: Is any finite group representable as the automorphism group of a finite tree? If not, what is typically unrepresentable?
In case of ambiguity: 
a homomorphism of finite rooted trees must preserved the root, and so does an isomorphism which is called an automorphism.
Context:
The motivation/spirit of the question is as follows. I make the isomorphism classes of finite graphs smaller by specifying a group acting on the graph's vertices, that is an isomorphism must now respect the group action (instead of the bigger $S(n)$ action).
Do I lose something by restricting myself to tree automorphisms instead of considering the group action?

REPLY [14 votes]: If I remember correctly, the automorphism groups of trees are those groups which you can make from symmetric groups by direct products and wreath products.  This is rather few groups.
An example of a group not occurring would be a nontrivial group with no subgroup of index 2. All simple groups from $Z_3$ upwards, for example. 
ADDED: An application of the constructive characterization is that a positive integer is the order of the group of a tree iff it is a product of factorials. So there are no odd numbers, only 2 and 6 as twice an odd number, etc..  Apparently these are called the Jordan-Polya numbers.
For homework, which groups have one of the allowed orders but still aren't groups of trees?