login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #17 Dec 23 2015 13:49:09

%S 3,11,28,63,143,304,699,1490,3460,7527,17687,38008,88803,194426,

%T 458476,986577,2306822,5052901

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

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

%H L. A. Székely and Hua Wang, <a href="http://dx.doi.org/10.1016/j.aam.2004.07.002">On Subtrees of Trees</a>, Advances in Applied Mathematics, Volume 34, Issue 1, January 2005, Pages 138-155.

%H L. A. Székely and Hua Wang, <a href="http://dx.doi.org/10.1016/j.dam.2006.05.008">Binary trees with the largest number of subtrees</a>, Discrete Applied Mathematics, Volume 155, Issue 3, 1 February 2007, Pages 374-385.

%H X.-M. Zhang and X.-D. Zhang, <a href="http://arxiv.org/abs/1209.0273">Trees with given degree sequences that have minimal subtrees</a>, arXiv preprint arXiv:1209.0273 [math.CO], 2012. - From _N. J. A. Sloane_, Dec 26 2012

%K nonn,more

%O 2,1

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