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 A182058 #11 Dec 16 2020 06:20:59 %S A182058 1,3,5,7,9,13,17,21,25,29,33,37,41,45,49,57,65,73,81,89 %N A182058 Number of moves needed to solve the Towers of Hanoi puzzle with 6 pegs and n disks. %C A182058 See A007664 for further references etc. %D A182058 Paul Cull and E. F. Ecklund, On the Towers of Hanoi and generalized Towers of Hanoi problems. Proceedings of the thirteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1982). Congr. Numer. 35 (1982), 229--238. MR0725883(85a:68059). %H A182058 <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a> %Y A182058 Cf. A007664 (4 pegs), A007665 (5 pegs). %K A182058 nonn,more %O A182058 1,2 %A A182058 _N. J. A. Sloane_, Apr 08 2012