id:A092781 - OEIS Search Results

Search: id:A092781

Displaying 1-1 of 1 results found.

page 1

Maximum number of non-empty subtrees of a binary tree with n leaves.

+0
2

3, 11, 28, 63, 143, 304, 699, 1490, 3460, 7527, 17687, 38008, 88803, 194426, 458476, 986577, 2306822, 5052901 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`This maximum number is achieved by the 'good' binary trees defined in the paper.`
	LINKS	`L. A. Szekely and Hua Wang, On Subtrees of Trees` `L. A. Szekely and Hua Wang, Binary trees with the largest number of subtrees`
	CROSSREFS	`Sequence in context: A136983 A119074 A163696 this_sequence A018743 A077279 A111227` `Adjacent sequences: A092778 A092779 A092780 this_sequence A092782 A092783 A092784`
	KEYWORD	`nonn`
	AUTHOR	`Hua Wang (wren1107(AT)yahoo.com.cn), Apr 23 2004`

page 1

Search completed in 0.002 seconds

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.