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 A382111 #16 Mar 31 2025 02:02:38 %S A382111 0,1,3,5,9,13,17,25,33,41,49,65,81,97,113,130,161,193,225,257,294 %N A382111 Maximum number of moves required to transition from the initial configuration (all disks on the first peg) to any possible configuration in the Towers of Hanoi puzzle with 4 pegs and n disks. %C A382111 Values for n = 1..20 taken from Korf, 2004 (see table 2). %C A382111 Somewhat surprisingly, this is not the same as A007664 from which first differs at a(15). %C A382111 This gives a lower bound on the diameter of Hanoi graphs with k = 4. %H A382111 Richard E. Korf, <a href="https://cdn.aaai.org/AAAI/2004/AAAI04-103.pdf">Best-first frontier search with delayed duplicate detection</a>, In Proceedings of the 19th national conference on Artifical intelligence (AAAI'04). AAAI Press, (2004), 650-657. %Y A382111 Cf. A007664. %K A382111 nonn,more %O A382111 0,3 %A A382111 _Geethan Pfeifer_, Mar 16 2025