Note on the Number of Rooted Complete $N$-ary Trees

Abstract

We determine a recursive formula for the number of rooted complete $N$-ary trees with $n$ leaves, which generalizes the formula for the sequence of Wedderburn-Etherington numbers. The diagonal sequence of our new sequences equals the sequence of numbers of rooted trees with $N+1$ vertices.