A222601 Conjectured number of Fibonacci numbers with exactly n 0-bits in their binary representation.
3, 5, 2, 4, 3, 1, 2, 3, 5, 1, 3, 5, 3, 3, 2, 1, 6, 1, 2, 3, 3, 2, 0, 3, 5, 4, 4, 3, 4, 2, 1, 2, 6, 1, 2, 2, 5, 4, 3, 5, 2, 2, 2, 1, 2, 2, 2, 5, 6, 3, 2, 2, 3, 1, 5, 1, 1, 0, 8, 4, 3, 3, 3, 3, 5, 4, 4, 2, 2, 2, 2, 3, 2, 6, 3, 0, 0, 2, 5, 5, 1, 6, 5, 0, 3, 5, 1
Offset: 0
Keywords
Links
- T. D. Noe, Table of n, a(n) for n = 0..1000
Crossrefs
Programs
-
Mathematica
f = Fibonacci[Range[0,100]]; Table[Length[Select[f, Count[IntegerDigits[#, 2], 0] == n &]], {n, 0, 20}]