|
%I #30 Jun 22 2021 06:39:53
%S 1,4,7,14,23,32,47,68,93,120,153,198,255,318,399,480,579,700,835,1012,
%T 1201,1428
%N Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n discs from the central vertex to an outer vertex, moving discs to adjacent vertices, following the rules of the Towers of Hanoi.
%H Caroline Holz auf der Heide. <a href="https://edoc.ub.uni-muenchen.de/20276/1/Holz_auf_der_Heide_Caroline.pdf">Distances and automatic sequences in distinguished variants of Hanoi graphs</a>. Dissertation. Fakultät für Mathematik, Informatik und Statistik. Ludwig-Maximilians-Universität München, 2016. [See Chapter 3.]
%H Paul K. Stockmeyer, <a href="http://www.cs.wm.edu/~pkstoc/boca.pdf">Variations on the Four-Post Tower of Hanoi Puzzle</a>, Congr. Numer., 102 (1994), pp. 3-12.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/StarGraph.html">Star Graph</a>
%H <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a>
%Y Cf. A291876.
%K nonn,hard,more
%O 1,2
%A _Eric M. Schmidt_, Sep 04 2017
%E Clarified definition and a(16)-a(18) added by _Borut Lužar_, Dec 11 2017
%E a(19)-a(21) by _Borut Lužar_, Mar 07 2019
%E a(22) added by _Ciril Petr_, Jun 22 2021
|
