proposed
approved
proposed
approved
editing
proposed
Array[Block[{k = 3, d = DigitCount[#, 2, 1]}, While[DigitCount[k #, 2, 1] != d, k++]; k #] &, 59] (* Michael De Vlieger, Feb 24 2019 *)
Michael De Vlieger, <a href="/A162215/b162215.txt">Table of n, a(n) for n = 1..10000</a>
proposed
editing
editing
proposed
a(n) = is the smallest multiple of n that is > greater than 2n and contains the same number of 1's in its binary representation as n contains.
Cf. A077459.
approved
editing
__Leroy Quet__, , Jun 28 2009
__Leroy Quet_, _, Jun 28 2009
_Leroy Quet, _, Jun 28 2009
a(4) corrected and sequence extended by _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 04 2009