A007078 Optimal cost of search tree.

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

Offset: 1

Author

N. J. A. Sloane, Mira Bernstein

Keywords

• nonn

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.
• 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.