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 A156596 #13 Dec 26 2024 10:41:25
%S A156596 1,0,1,2,0,2,0,2,1,0,1,2,0,2,0,2,1,0,1,0,1,2,0,2,1,0,1,0,1,2,0,2,1,0,
%T A156596 1,0,1,2,0,2,0,2,1,0,1,2,0,2,0,2,1,0,1,0,1,2,0,2,1,0,1,0,1,2,0,2,1,0,
%U A156596 1,0,1,2,0,2,0,2,1,0,1,2,0,2,0,2,1,0,1,2,0,2,0,2,1,0,1,0,1,2,0,2,1,0,1,0,1
%N A156596 Infinite Fibonacci word fractal sequence.
%C A156596 Apply to A143667 the map : 0 -> 12, 1 -> 10, 2 -> 02. or apply to A003849 (the Fibonacci word), after grouping the terms 2 by 2, the map : "00" -> "12", "01"->"10, "10"->"02". Draws the Fibonacci word fractal curve when applying the following drawing rule: if "0" then draw a segment forward, if "1" then draw a segment forward and turn 90A degs right, if "2" the draw segment and turn 90A degs left.
%D A156596 M. Lothaire, Combinatorics on words, Cambridge University Press.
%H A156596 Reinhard Zumkeller, <a href="/A156596/b156596.txt">Table of n, a(n) for n = 1..1000</a>
%H A156596 A. Monnerot-Dumaine, <a href="http://alexis.monnerot-dumaine.neuf.fr/articles/fibonacci%20fractal.pdf">Fibonacci word fractal</a>
%H A156596 Alexis Monnerot-Dumaine, <a href="/A171587/a171587.pdf">The Fibonacci word fractal</a> [Cached copy, with permission]
%t A156596 Partition[Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}]&, {0}, 10], 2] /. {{0, 0} -> {1, 2}, {0, 1} -> {1, 0}, {1, 0} -> {0, 2}} // Flatten (* _Jean-François Alcover_, Jul 16 2015 *)
%o A156596 (Haskell)
%o A156596 a143667 n = a143667_list !! (n-1)
%o A156596 a143667_list = f a003849_list where
%o A156596 f (0:0:ws) = 0 : f ws; f (0:1:ws) = 1 : f ws; f (1:0:ws) = 2 : f ws
%o A156596 -- _Reinhard Zumkeller_, Jul 29 2014
%Y A156596 Cf. A003849, A143667.
%K A156596 nice,nonn
%O A156596 1,4
%A A156596 _Alexis Monnerot-Dumaine_, Feb 10 2009