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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007078 Optimal cost of search tree.
(Formerly M2402)
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; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

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

LINKS

Table of n, a(n) for n=1..53.

William J. Knight, Search in an ordered array having variable probe cost, SIAM J. Comput. 17 (1988), no. 6, 1203-1214.

W. J. Knight, Letter to N. J. A. Sloane, Jul. 1991

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

CROSSREFS

Cf. A007077.

Sequence in context: A080751 A025218 A258782 * A226332 A226331 A316312

Adjacent sequences:  A007075 A007076 A007077 * A007079 A007080 A007081

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mira Bernstein

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 07:08 EDT 2019. Contains 327253 sequences. (Running on oeis4.)