Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.

A007077

Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.

Terms

    a(0) =1a(1) =4a(2) =10a(3) =19a(4) =31a(5) =47a(6) =68a(7) =92a(8) =120a(9) =153a(10) =190a(11) =232a(12) =279a(13) =332a(14) =392a(15) =454a(16) =521a(17) =593a(18) =670a(19) =753a(20) =841a(21) =936a(22) =1036a(23) =1141a(24) =1252a(25) =1370a(26) =1494a(27) =1625a(28) =1763a(29) =1909

External references