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 A179969 #10 Aug 11 2014 22:45:44
%S A179969 0,1,1,2,3,2,3,5,6,5,6,10,11,13,11,13,21,22,26,27,22,26,27,43,45,53,
%T A179969 54,45,53,54,86,90,91,107,109,90,91,107,109,173,181,182,214,218,181,
%U A179969 182,214,218,346,347,363,365,429,437,363,365,429,437,693,694,726,730,858,859,875,726,730,858,859,875
%N A179969 Ordered list in decimal notation of the subwords appearing in the infinite Fibonacci word A005614.
%C A179969 See A178992 for more details. In binary, the subwords are 0, 1, 01, 10, 11, 010, 011, 101, 110, 0101, 0110, 1010, 1011, 1101,... Converting these numbers to decimal produces this sequence. Except for the initial 0, subwords of the form 0X occur later in the sequence than X. Hence, the second occurrence of a number in this sequence represents the subword having a leading zero. There is a link to a file containing the subwords in binary.
%H A179969 T. D. Noe, <a href="/A179969/b179969.txt">Table of n, a(n) for n = 1..1652</a>
%H A179969 T. D. Noe, <a href="/A179969/a179969.txt">A list of 1652 subwords in binary</a>
%t A179969 iter=8; f=Nest[Flatten[#/.{0->{1},1->{1,0}}]&,{1},iter]; u={}; n=1; While[lst={}; k=0; While[num=FromDigits[Take[f,{1,n}+k],2]; lst=Union[lst,{num}]; Length[lst]<n+1 && k<Length[f]-n, k++]; Length[lst]==n+1, u=Join[u,lst]; n++]; u
%K A179969 nonn,base
%O A179969 1,4
%A A179969 _T. D. Noe_, Jan 12 2011