P276: Enumeration of all nonisomorphic rooted plane trees with $n$ vertices

P276: Enumeration of all nonisomorphic rooted plane trees with $n$ vertices

Input:

An integer $n$.

Output:

All nonisomorphic rooted plane trees with $n$ vertices.

Complexity:

Constant amortized time per solution.

Comment:

Reference:

[Sawada2006] (Bibtex)