This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A222601 #8 Mar 11 2013 14:03:18
%S A222601 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,
%T A222601 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,
%U A222601 2,2,2,3,2,6,3,0,0,2,5,5,1,6,5,0,3,5,1
%N A222601 Conjectured number of Fibonacci numbers with exactly n 0-bits in their binary representation.
%H A222601 T. D. Noe, <a href="/A222601/b222601.txt">Table of n, a(n) for n = 0..1000</a>
%t A222601 f = Fibonacci[Range[0,100]]; Table[Length[Select[f, Count[IntegerDigits[#, 2], 0] == n &]], {n, 0, 20}]
%Y A222601 Cf. A004685 (Fibonacci numbers in binary), A214853 (one 0-bit), A222602.
%Y A222601 Cf. A222295, A222296.
%K A222601 nonn
%O A222601 0,1
%A A222601 _T. D. Noe_, Mar 08 2013