

A162955


a(1)=1. a(n) = the smallest integer >a(n1) 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.


0



1, 2, 9, 128, 132, 160, 448, 32768, 32769, 32772, 32960, 33024, 33088, 33344, 33552, 2147483648, 2147483650, 2147483652, 2147483840, 2147483904, 2147483968, 2147484224, 2147484240, 2147484672, 2147484736, 2147485760, 2147485968
(list;
graph;
refs;
listen;
history;
text;
internal format)




