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 A004685 #32 Sep 08 2022 08:44:33
%S A004685 0,1,1,10,11,101,1000,1101,10101,100010,110111,1011001,10010000,
%T A004685 11101001,101111001,1001100010,1111011011,11000111101,101000011000,
%U A004685 1000001010101,1101001101101,10101011000010,100010100101111,110111111110001,1011010100100000,10010010100010001
%N A004685 Fibonacci numbers written in base 2.
%H A004685 Vincenzo Librandi, <a href="/A004685/b004685.txt">Table of n, a(n) for n = 0..1000</a>
%H A004685 Wayne State University College of Engineering, <a href="http://www.youtube.com/watch?v=TRNhnyGSVsA">Engineering Bits & Bytes: The Fibonacci Puzzle</a>, (Video, this sequence is looped through in 16-bit words close to the beginning and again at the end).
%F A004685 a(n) = A007088(A000045(n)). - _Jonathan Vos Post_, Aug 24 2010
%p A004685 with(combinat): seq(convert(fibonacci(n),binary),n=0..25); # _Muniru A Asiru_, Oct 10 2018
%t A004685 Table[FromDigits[IntegerDigits[Fibonacci[n], 2]], {n, 0, 30}] (* _Stefan Steinerberger_, Apr 14 2006 *)
%o A004685 (PARI) a(n)=subst(Pol(binary(fibonacci(n))),'x,10) \\ _Charles R Greathouse IV_, Feb 03 2014
%o A004685 (PARI) apply( n->fromdigits(binary(fibonacci(n))), [0..19]) \\ _M. F. Hasler_, Jun 22 2018
%o A004685 (PARI) vector(50, n, n--; fromdigits(digits(fibonacci(n), 2))) \\ _G. C. Greubel_, Oct 09 2018
%o A004685 (Magma) [Seqint(Intseq(Fibonacci(n),2)): n in [0..50]]; // _G. C. Greubel_, Oct 09 2018
%Y A004685 Cf. A004686 .. A004694: Fibonacci numbers written in base 3, 4, ..., 13.
%Y A004685 Cf. A004676 .. A004684: Primes written in base 2, 3, 4, ..., 11.
%Y A004685 Cf. A004643, ..., A004668 : powers of 2 resp. of 3 in base 3, 4, 5, ..., 26.
%K A004685 nonn,easy,base
%O A004685 0,4
%A A004685 _N. J. A. Sloane_