2147483652

Appears in sequences

• 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.at n=17A162955
• Numbers of the form A019434(i) + A000668(j).at n=36A168335