login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007077 Optimal cost of search tree.
(Formerly M3379) 		1
1, 4, 10, 19, 31, 47, 68, 92, 120, 153, 190, 232, 279, 332, 392, 454, 521, 593, 670, 753 (list; graph; refs; listen; history; internal format)
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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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 * A009895 A027371 A098576

Adjacent sequences:  A007074 A007075 A007076 * A007078 A007079 A007080

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein (mira(AT)math.berkeley.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:23 EST 2012. Contains 205694 sequences.