VOOZH about

URL: https://oeis.org/A092781

⇱ A092781 - OEIS

login
A092781
Maximum number of nonempty subtrees of a binary tree with n leaves.
1
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
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 A391645 A302509
KEYWORD
nonn,more
AUTHOR
Hua Wang (wren1107(AT)yahoo.com.cn), Apr 23 2004
STATUS
approved