Note on the number of rooted complete N-ary trees

Andres, Dominique (2010) Note on the number of rooted complete N-ary trees.
Published in: Ars Combinatoria Vol. XCIV (Jan.). ISSN XCIV

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 to the sequence of numbers of rooted trees with N+1 vertices.


Actions:
Download: [img] Postscript - Preprinted Version
Download (103Kb) | Preview
Download: [img] PDF - Preprinted Version
Download (44Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik2007-563
Depositing User: Dominique Andres
Date Deposited: 04 Dec 2007 00:00
Last Modified: 19 Dec 2011 09:44
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/563