%I M2402 #24 Nov 16 2017 06:19:48
%S 1,3,5,7,9,12,15,19,23,26,29,32,35,38,41,45,49,53,57,62,67,72,77,83,
%T 89,93,97,101,105,109,113,117,121,125,129,133,137,141,145,150,155,160,
%U 165,170,175,180,185,191,197,203,209,215,221
%N Optimal cost of search tree.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H William J. Knight, <a href="https://doi.org/10.1137/0217076">Search in an ordered array having variable probe cost</a>, SIAM J. Comput. 17 (1988), no. 6, 1203-1214.
%H W. J. Knight, <a href="/A007077/a007077.pdf">Letter to N. J. A. Sloane, Jul. 1991</a>
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%Y Cf. A007077.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, _Mira Bernstein_