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”).

A115185
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
1, 2, 9, 23, 58, 142, 345, 835, 2018, 4874, 11769, 28415, 68602, 165622, 399849, 965323, 2330498, 5626322, 13583145, 32792618, 79168378, 191129374, 461427129, 1113983635, 2689394402, 6492772442, 15674939289, 37842651023, 91360241338
OFFSET
1,2
REFERENCES
Mark Manasse et al., The Panex puzzle, in Tribute to a Mathemagician, Peters, 2005, pp. 145-161.
FORMULA
a(n) = A109175(n) if n odd, = A109175(n)-1 if n even.
CROSSREFS
Cf. A109175.
Sequence in context: A154118 A296284 A376750 * A349189 A091107 A133469
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 11 2006
STATUS
approved