id:A076615 - OEIS Search Results

Search: id:A076615

Displaying 1-1 of 1 results found.

page 1

Number of permutations of {1,2,...,n} that result in a binary search tree (when elements of the permutation are inserted in that order) with the minimum possible height.

+0
1

1, 2, 2, 16, 40, 80, 80, 11360 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`a(3) = 2 because only the permutations 1 2 3 and 3 2 1 result in a binary search tree of minimal height`
	CROSSREFS	`Sequence in context: A088139 A152556 A113123 this_sequence A098777 A127226 A001119` `Adjacent sequences: A076612 A076613 A076614 this_sequence A076616 A076617 A076618`
	KEYWORD	`nonn`
	AUTHOR	`Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca), Oct 22 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research