The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors 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
William J. Knight, Search in an ordered array having variable probe cost, SIAM J. Comput. 17 (1988), no. 6, 1203-1214.
CROSSREFS
Cf. A007077.
Sequence in context: A025218 A258782 A349993 * A226332 A226331 A333601
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 13 00:21 EDT 2024. Contains 373362 sequences. (Running on oeis4.)