%I #14 Dec 28 2019 07:48:22
%S 19,33,34,43,49,53,69,74,79,82,103,107,109,141,142,166,177,178,201,
%T 202,209,226,261,268,292,295,299,301,302,309,314,327,334,339,341,346,
%U 355,358,362,367,379,388,391,395,398,403,422,431,439,443,451,453,454,458
%N Positive integers k that when written in binary have exactly the same number of (non-leading) 0's as the number of divisors of k.
%H Amiram Eldar, <a href="/A152088/b152088.txt">Table of n, a(n) for n = 1..10000</a>
%e 34 written in binary is 100010, which has four 0's. Also, 34 has 4 divisors (1,2,17,34). Since the number of binary 0's equals the number of divisors, then 34 is included in this sequence.
%t Select[Range[500], DigitCount[#, 2, 0] == DivisorSigma[0, #] &] (* _Amiram Eldar_, Dec 28 2019 *)
%Y Cf. A000005, A023416, A071593, A080791.
%K nonn,base
%O 1,1
%A _Leroy Quet_, Nov 23 2008
%E Extended by _Ray Chandler_, Nov 26 2008
|