0,3

Each node of the tree is a subset of the labeled set {1,...,n}. If the subset node is empty, it must have degree at least 3.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

L. R. Foulds and R. W. Robinson, Determining the asymptotic number of phylogenetic trees, pp. 110-126 of Combinatorial Mathematics VII (Newcastle, August 1979), ed. R. W. Robinson, G. W. Southern and W. D. Wallis. Lect. Notes Math., 829. Springer, 1980.

J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709.

K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318.

R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.26.

N. J. A. Sloane, Transforms

Index entries for sequences related to trees

STIRLING transform of A005263. E.g.f.: 1+B(x)-B(x)^2 where B(x) is e.g.f. of A005172.

For n >= 2, A005640(n) = 2^n*A006351(n) = 2^(n+1)*A000311(n).

Sequence in context: A136282 A092934 A139679 this_sequence A153540 A153568 A153531

Adjacent sequences: A005637 A005638 A005639 this_sequence A005641 A005642 A005643

nonn,nice,easy

N. J. A. Sloane (njas(AT)research.att.com).

More terms, formula and comment from Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.