P442: Enumeration of all (rooted) trees with $n$ vertices

P442: Enumeration of all (rooted) trees with $n$ vertices

Input:

An integer $n$.

Output:

Enumeration of all (rooted) trees with $n$ vertices.

Complexity:

Comment:

Reference:

[Knop1981] (Bibtex)