A092781 Maximum number of nonempty subtrees of a binary tree with n leaves.

3, 11, 28, 63, 143, 304, 699, 1490, 3460, 7527, 17687, 38008, 88803, 194426, 458476, 986577, 2306822, 5052901

Offset

2,1

Comments

This maximum number is achieved by the 'good' binary trees defined in the paper.

Links

Table of n, a(n) for n=2..19.

L. A. Székely and Hua Wang, On Subtrees of Trees, Advances in Applied Mathematics, Volume 34, Issue 1, January 2005, Pages 138-155.

L. A. Székely and Hua Wang, Binary trees with the largest number of subtrees, Discrete Applied Mathematics, Volume 155, Issue 3, 1 February 2007, Pages 374-385.

X.-M. Zhang and X.-D. Zhang, Trees with given degree sequences that have minimal subtrees, arXiv preprint arXiv:1209.0273 [math.CO], 2012. - From N. J. A. Sloane, Dec 26 2012

Crossrefs

Sequence in context: A211810 A182260 A163696 * A332669 A302509 A335899

Adjacent sequences: A092778 A092779 A092780 * A092782 A092783 A092784

Keyword

nonn,more

Author

Hua Wang (wren1107(AT)yahoo.com.cn), Apr 23 2004

Status

approved