%I #12 Mar 11 2013 13:57:04

%S 1,4,4,2,3,3,4,1,4,2,1,5,5,2,2,2,5,4,3,2,2,2,3,5,3,3,2,4,2,1,4,3,2,3,

%T 3,1,6,3,2,3,3,4,4,5,0,0,3,3,2,2,5,4,3,1,5,2,2,2,5,7,3,0,0,1,2,7,3,3,

%U 2,4,3,1,2,4,4,2,0,3,1,3,7,3,4,1,3,4,3

%N Conjectured number of Fibonacci numbers with exactly n bits set in their binary representation.

%H T. D. Noe, <a href="/A222295/b222295.txt">Table of n, a(n) for n = 0..1000</a>

%e We set a(1) = 4 because Fib(1) = 1, Fib(2) = 1, Fib(3) = 2, and Fib(6) = 8.

%t f = Fibonacci[Range[0,500]]; Table[Length[Select[f, Total[IntegerDigits[#, 2]] == n &]], {n, 0, 87}]

%Y Cf. A004685 (Fibonacci numbers in binary), A221158 (two bits set), A222296.

%Y Cf. A011373 (number of bits set in each Fibonacci number).

%Y Cf. A222601, A222602, A222757, A222758.

%K nonn,base

%O 0,2

%A _T. D. Noe_, Feb 22 2013