a(1)=1. a(n) = the smallest integer >a(n-1) such that both a(n) and the number of divisors of a(n) contain the same number of 1's in their binary representations as n has when written in binary.

A162955

a(1)=1. a(n) = the smallest integer >a(n-1) such that both a(n) and the number of divisors of a(n) contain the same number of 1's in their binary representations as n has when written in binary.

Terms

    a(0) =1a(1) =2a(2) =9a(3) =128a(4) =132a(5) =160a(6) =448a(7) =32768a(8) =32769a(9) =32772a(10) =32960a(11) =33024a(12) =33088a(13) =33344a(14) =33552a(15) =2147483648a(16) =2147483650a(17) =2147483652a(18) =2147483840a(19) =2147483904a(20) =2147483968a(21) =2147484224a(22) =2147484240a(23) =2147484672a(24) =2147484736a(25) =2147485760a(26) =2147485968

External references