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 A210243 #16 Jan 20 2021 03:33:35 %S A210243 1,3,1,2,3,2,1,3,2,1,2,3,1,3,1,2,3,2,3,1,2,1,3,2,1,3,1,2,3,2,1,3,2,1, %T A210243 2,3,1,3,2,1,3,2,3,1,2,1,2,3,1,3,1,2,3,2,1,3,2,1,2,3,1,3,1,2,3,2,3,1, %U A210243 2,1,3,2,1,3,1,2,3,2,3,1,2,1,2,3,1,3,2 %N A210243 Hanoi solutions (odd), the disks are moved from pillar 1 to pillar 3. For disks = 2k+1 use the first 2^(2k+2)-2 number pairs. %H A210243 <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a> %e A210243 The solution to Hanoi with 3 disks from pillar 1 to pillar 3 is (1,3), (1,2), (3,2), (1,3), (2,1), (2,3), (1,3). %Y A210243 If the number of disks is even see A101608. %K A210243 nonn,easy %O A210243 1,2 %A A210243 _Y. Z. Chen_, Mar 24 2012