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 A060571 #18 Sep 04 2021 05:53:15 %S A060571 0,0,1,0,2,2,0,0,1,1,2,1,0,0,1,0,2,2,0,2,1,1,2,2,0,0,1,0,2,2,0,0,1,1, %T A060571 2,1,0,0,1,1,2,2,0,2,1,1,2,1,0,0,1,0,2,2,0,0,1,1,2,1,0,0,1,0,2,2,0,2, %U A060571 1,1,2,2,0,0,1,0,2,2,0,2,1,1,2,1,0,0,1,1,2,2,0,2,1,1,2,2,0,0,1,0,2,2,0,0,1 %N A060571 Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 (here) to peg A060572. %C A060571 a(n) is equal to a(2n) with the 1's and 2s reversed, thus a(n) = a(4n). - Donald Sampson (marsquo(AT)hotmail.com), Dec 01 2003 %H A060571 J.-P. Allouche, D. Astoorian, J. Randall, and J. Shallit, <a href="http://www.jstor.org/stable/2974693">Morphisms, squarefree strings, and the Tower of Hanoi puzzle</a>, Amer. Math. Monthly 101 (1994), 651-658. %H A060571 <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a> %F A060571 If n>2^A001511(n) then a(n)=a(n-2^A001511(n))-(-1)^A001511(n) mod 3 =A060572(n-2^A001511(n)), otherwise a(k)=0. Also A001511(n)-th digit from right of A055662(n-1). %e A060571 Start by moving first disk from peg 0 (to peg 1), second disk from peg 0 (to peg 2), first disk form peg 1 (to peg 2), etc. so sequence starts 0,0,1,... %Y A060571 Cf. A001511, A055662, A060572, A060573, A060574, A060575. %K A060571 easy,nonn %O A060571 1,5 %A A060571 _Henry Bottomley_, Apr 03 2001