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 A059016 #24 Dec 08 2024 12:44:17
%S A059016 1,0,0,1,0,1,3,1,2,4,1,3,6,3,3,6,2,4,8,8,5,8,7,4,10,11,8,7,8,7,12,10,
%T A059016 13,9,11,13,12,11,16,14,11,11,14,13,12,16,10,19,21,15,16,18,18,19,21,
%U A059016 16,17,23,16,20,25,23,16,20,24,19,26,20,32,24,25,27,24,23,27,28,29,31
%N A059016 Number of 0's in binary expansion of Fibonacci(n).
%C A059016 Records are 1, 3, 4, 6, 8, 10, 11, 12, 13, 16, 19, 21, 23, 25, 26, 32, ... at positions 0, 6, 9, 12, 18, 24, 25, 30, 32, 38, 47, 48, 57, ... - _R. J. Mathar_, Nov 05 2012
%H A059016 T. D. Noe, <a href="/A059016/b059016.txt">Table of n, a(n) for n = 0..1000</a>
%F A059016 a(n) = A023416(A000045(n)). - _R. J. Mathar_, Nov 05 2012
%p A059016 with(combinat): a := proc (n) local fbin: fbin := convert(fibonacci(n), base, 2): nops(fbin)-add(fbin[j], j = 1 .. nops(fbin)) end proc: seq(a(n), n = 0 .. 80); # _Emeric Deutsch_, Jul 09 2009
%o A059016 (PARI) a(n)={ my(k=fibonacci(n)); if (k==0, 1, #select(x->!x, binary(k)))} \\ _Harry J. Smith_, Jun 24 2009
%Y A059016 Cf. A011373.
%K A059016 nonn,base
%O A059016 0,7
%A A059016 _Patrick De Geest_, Jan 15 2001