id:A007078 - OEIS Search Results

Search: id:A007078

Displaying 1-1 of 1 results found.

page 1

Optimal cost of search tree.
(Formerly M2402)

+0
2

1, 3, 5, 7, 9, 12, 15, 19, 23, 26, 29, 32, 35, 38, 41, 45, 49, 53, 57, 62, 67, 72, 77, 83, 89, 93, 97, 101, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141, 145, 150, 155, 160, 165, 170, 175, 180, 185, 191, 197, 203, 209, 215, 221 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`Knight, William J.; Search in an ordered array having variable probe cost. SIAM J. Comput. 17 (1988), no. 6, 1203-1214.`
	LINKS	`Index entries for sequences related to rooted trees` `Index entries for sequences related to trees`
	CROSSREFS	`Cf. A007077.` `Sequence in context: A072154 A080751 A025218 this_sequence A118015 A122643 A096231` `Adjacent sequences: A007075 A007076 A007077 this_sequence A007079 A007080 A007081`
	KEYWORD	`nonn`
	AUTHOR	`njas, Mira Bernstein (mira(AT)math.berkeley.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research