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 A285677 #15 Oct 10 2018 10:00:48
%S A285677 0,1,2,1,2,0,1,0,1,2,1,2,0,1,0,1,2,0,1,0,1,2,1,2,0,1,0,1,2,1,2,0,1,0,
%T A285677 1,2,0,1,0,1,2,1,2,0,1,0,1,2,0,1,0,1,2,1,2,0,1,0,1,2,1,2,0,1,0,1,2,0,
%U A285677 1,0,1,2,1,2,0,1,0,1,2,1,2,0,1,0,1,2
%N A285677 {0010->2}-transform of the infinite Fibonacci word A003849.
%C A285677 As a word, A003849 = 01001010010010100..., and replacing each 0010 by 2 gives 0121201012120101201012120101212010...
%C A285677 Warning: "replacing each 0010 by 2" means "replacing each 0010 by 2 from left to right, consecutively". The result is that the word a(8)...a(14)=0010010 in A003849 is replaced by 201, not by 22. - _Michel Dekking_, Aug 27 2018
%H A285677 Clark Kimberling, <a href="/A285677/b285677.txt">Table of n, a(n) for n = 1..10000</a>
%t A285677 s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 13] ; (* A003849 *)
%t A285677 w = StringJoin[Map[ToString, s]]
%t A285677 w1 = StringReplace[w, {"0010" -> "2"}]
%t A285677 st = ToCharacterCode[w1] - 48; (* A285677 *)
%t A285677 Flatten[Position[st, 0]]; (* A285678 *)
%t A285677 Flatten[Position[st, 1]]; (* A182761 - conjectured *)
%t A285677 Flatten[Position[st, 2]]; (* A285679 *)
%Y A285677 Cf. A003849, A284620, A285678, A182761, A285679.
%K A285677 nonn,easy
%O A285677 1,3
%A A285677 _Clark Kimberling_, May 11 2017