Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.

Terms

a(0) =0a(1) =1a(2) =3a(3) =5a(4) =8a(5) =11a(6) =14a(7) =17a(8) =21a(9) =25a(10) =29a(11) =33a(12) =37a(13) =41a(14) =45a(15) =49a(16) =54a(17) =59a(18) =64a(19) =69a(20) =74a(21) =79a(22) =84a(23) =89a(24) =94a(25) =99a(26) =104a(27) =109a(28) =114a(29) =119