|
%I #15 Jul 30 2021 08:29:45
%S 1,2,3,4,8,10,14,15,16,32,44,45,50,52,63,64,128,130,135,136,138,152,
%T 154,165,170,174,182,184,186,189,190,195,222,230,231,232,238,246,248,
%U 250,255,256,441,484,512,567,592,656,688,752,848,891,944,976
%N Numbers having equal number of divisors and binary digits.
%H G. C. Greubel, <a href="/A135772/b135772.txt">Table of n, a(n) for n = 1..1000</a>
%e a(1) = 1 since 1 has 1 divisor and 1 binary digit.
%e a(2), a(3) = 2, 3 since 2 = 10_2 and 3 = 11_2 have 2 divisors and 2 binary digits.
%e a(4) = 4 = 100_2 is the only number with 3 binary digits having 3 divisors.
%e 8, 10, 14, 15 have 4 binary digits and 4 divisors.
%t Select[Range[500], DivisorSigma[0, #] == IntegerLength[#, 2] &] (* _G. C. Greubel_, Nov 08 2016 *)
%o (PARI) for(d=1,10,for(n=2^(d-1),2^d-1,d==numdiv(n)&print1(n", ")))
%o (Python)
%o from sympy import divisor_count
%o def ok(n): return divisor_count(n) == n.bit_length()
%o print(list(filter(ok, range(1, 977)))) # _Michael S. Branicky_, Jul 29 2021
%Y Cf. A000005, A070939.
%Y Cf. A135773, A135774, A135775, A135776, A135777, A135778, A135779, A095862.
%K base,nonn
%O 1,2
%A _M. F. Hasler_, Nov 28 2007
|
