Optimal cost of search tree.

Terms

a(0) =1a(1) =3a(2) =5a(3) =7a(4) =9a(5) =12a(6) =15a(7) =19a(8) =23a(9) =26a(10) =29a(11) =32a(12) =35a(13) =38a(14) =41a(15) =45a(16) =49a(17) =53a(18) =57a(19) =62a(20) =67a(21) =72a(22) =77a(23) =83a(24) =89a(25) =93a(26) =97a(27) =101a(28) =105a(29) =109