

A222295


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


4



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, 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, 2, 4, 3, 1, 2, 4, 4, 2, 0, 3, 1, 3, 7, 3, 4, 1, 3, 4, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


LINKS



EXAMPLE

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


MATHEMATICA

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


CROSSREFS

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


KEYWORD

nonn,base


AUTHOR



STATUS

approved



