login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Minimum number of moves to solve a variant of the first Panex puzzle of order n of transferring a side tower to the center column.
1

%I #4 Mar 30 2012 16:50:23

%S 1,2,9,23,58,142,345,835,2018,4874,11769,28415,68602,165622,399849,

%T 965323,2330498,5626322,13583145,32792618,79168378,191129374,

%U 461427129,1113983635,2689394402,6492772442,15674939289,37842651023,91360241338

%N Minimum number of moves to solve a variant of the first Panex puzzle of order n of transferring a side tower to the center column.

%D Mark Manasse et al., The Panex puzzle, in Tribute to a Mathemagician, Peters, 2005, pp. 145-161.

%H N. Baxter, <a href="http://www.baxterweb.com/puzzles/panex/index.htm">Panex Puzzle Resources</a>.

%F a(n) = A109175(n) if n odd, = A109175(n)-1 if n even.

%Y Cf. A109175.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Apr 11 2006