Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 11 2014 01:32:43
%S 1,2,9,8,12,18,448,128,20,36,704,48,832,1216,720,32768,68,72,1296,80,
%T 1344,1600,900,96,2240,2368,1200,2624,1584,2352,414720,2147483648,132,
%U 160,3136,260,4288,4416,2448,272,4672,5184,2704,6208,3600,4400,640000
%N a(n) = the smallest positive integer not yet occurring in the sequence 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.
%C Rearrangement of A162952. [From _Max Alekseyev_, Apr 29 2010]
%F a(2^n) = 2^(2^n - 1) [From _Max Alekseyev_, Apr 29 2010]
%Y A162952
%K base,nonn
%O 1,2
%A _Leroy Quet_, Jul 18 2009
%E More terms from _Max Alekseyev_, Apr 29 2010