Sorting numbers: number of comparisons for merge insertion sort of n elements.

Terms

a(0) =0a(1) =1a(2) =3a(3) =5a(4) =7a(5) =10a(6) =13a(7) =16a(8) =19a(9) =22a(10) =26a(11) =30a(12) =34a(13) =38a(14) =42a(15) =46a(16) =50a(17) =54a(18) =58a(19) =62a(20) =66a(21) =71a(22) =76a(23) =81a(24) =86a(25) =91a(26) =96a(27) =101a(28) =106a(29) =111