Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements.
A239100
Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =2a(4) =3a(5) =4a(6) =6a(7) =8a(8) =10a(9) =13a(10) =17a(11) =22a(12) =28a(13) =37a(14) =47a(15) =59a(16) =75a(17) =96a(18) =120a(19) =153a(20) =194a(21) =242a(22) =309a(23) =391a(24) =487a(25) =619a(26) =784a(27) =976a(28) =1241a(29) =1570
External references
- oeis: A239100