id:A007077 - OEIS Search Results

Search: id:A007077

Displaying 1-1 of 1 results found.

page 1

Optimal cost of search tree.
(Formerly M3379)

+0
2

1, 4, 10, 19, 31, 47, 68, 92, 120, 153, 190, 232, 279, 332, 392, 454, 521, 593, 670, 753 (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. A007078.` `Sequence in context: A022793 A005448 A037040 this_sequence A009895 A027371 A098576` `Adjacent sequences: A007074 A007075 A007076 this_sequence A007078 A007079 A007080`
	KEYWORD	`nonn`
	AUTHOR	`njas, Mira Bernstein (mira(AT)math.berkeley.edu)`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.