Abstract :
The possible values of the number of messages generated by an information source which can be encoded into complete tree codes for successive coding alphabet sizes 2, 3, 4,..., D are derived. Properties and relations for the smallest such values are given.
