The binary expansion of a(n) is an initial 1 bit then tracks where the swaps occur in the exchange sort algorithm sorting the binary expansion of n into decreasing order.

A380145

The binary expansion of a(n) is an initial 1 bit then tracks where the swaps occur in the exchange sort algorithm sorting the binary expansion of n into decreasing order.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =8a(4) =9a(5) =8a(6) =8a(7) =64a(8) =66a(9) =68a(10) =69a(11) =64a(12) =65a(13) =64a(14) =64a(15) =1024a(16) =1032a(17) =1040a(18) =1042a(19) =1056a(20) =1058a(21) =1060a(22) =1061a(23) =1024a(24) =1026a(25) =1028a(26) =1029a(27) =1024a(28) =1025a(29) =1024

External references