a(n) is the smallest number that requires at least n adjacent bit swaps in order to pack all the ones to the right.

A243112

a(n) is the smallest number that requires at least n adjacent bit swaps in order to pack all the ones to the right.

Terms

    a(0) =0a(1) =2a(2) =4a(3) =8a(4) =12a(5) =20a(6) =24a(7) =40a(8) =48a(9) =56a(10) =88a(11) =104a(12) =112a(13) =176a(14) =208a(15) =224a(16) =240a(17) =368a(18) =432a(19) =464a(20) =480a(21) =736a(22) =864a(23) =928a(24) =960a(25) =992a(26) =1504a(27) =1760a(28) =1888a(29) =1952

External references