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 A284394 #8 Aug 28 2017 04:21:12
%S A284394 0,1,0,0,2,0,0,1,0,0,2,0,0,2,0,0,1,0,0,2,0,0,1,0,0,2,0,0,2,0,0,1,0,0,
%T A284394 2,0,0,2,0,0,1,0,0,2,0,0,1,0,0,2,0,0,2,0,0,1,0,0,2,0,0,1,0,0,2,0,0,2,
%U A284394 0,0,1,0,0,2,0,0,2,0,0,1,0,0,2,0,0,1
%N A284394 {101->2}-transform of the infinite Fibonacci word A003849.
%C A284394 The sequences p = A032766, q = A284395, r = A284396, of positions of 0,1,2, respectively, partition the positive integers. Let t,u,v be the slopes of p, q, r, respectively. Then t = 3/2, u = (9+3*sqrt(5))/2, v = (3+3*sqrt(5))/2, and 1/t + 1/u + 1/v = 1.
%H A284394 Clark Kimberling, <a href="/A284394/b284394.txt">Table of n, a(n) for n = 1..10000</a>
%e A284394 As a word, A003849 = 01001010010010100..., and replacing each 101 by 2 gives 01002001002002001...
%t A284394 s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 13] (* A003849 *)
%t A284394 w = StringJoin[Map[ToString, s]]; w1 = StringReplace[w, {"101" -> "2"}]
%t A284394 st = ToCharacterCode[w1] - 48 (* A284394 *)
%t A284394 Flatten[Position[st, 0]] (* A032766 *)
%t A284394 Flatten[Position[st, 1]] (* A284395 *)
%t A284394 Flatten[Position[st, 2]] (* A284396 *)
%Y A284394 Cf. A003849, A032766, A284395, A284396.
%K A284394 nonn,easy
%O A284394 1,5
%A A284394 _Clark Kimberling_, May 02 2017