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 A181632 #9 Mar 05 2015 13:46:39
%S A181632 0,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,0,1,0,1,1,1,1,0,1,1,1,1,0,1,1,1,
%T A181632 1,1,0,1,0,1,1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,1,1,1,1,
%U A181632 1,0,1,1,1,1,1,1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,1,0,1,1,1,1
%N A181632 The Fibonacci Champernowne sequence.
%C A181632 Uses Fibonacci Maximal notation: headings are (..., 13, 8, 5, 3, 2, 1) filling in terms from the right.
%C A181632 Minimal notation fills in from the left. 8 in Fibonacci Maximal = (1011) = (5 + 2 + 1), whereas 8 in Minimal = (1100) = (5 + 3).
%F A181632 Write n in Fibonacci Maximal notation and juxtapose.
%e A181632 First few segregated Fibonacci terms (0-6) = (0, 1, 10, 11, 101, 110, 111);
%e A181632 so the juxtaposed string begins (0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1,...).
%t A181632 Flatten[DeleteCases[IntegerDigits[-1 + Range[200], 2], {___, 0, 0, ___}]]
%t A181632 (* _Peter J. C. Moses_, Mar 03 2015 *)
%Y A181632 Cf. A030190, A181630, A181631.
%K A181632 nonn,base
%O A181632 0,1
%A A181632 _Gary W. Adamson_, Nov 02 2010