Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115185
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
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 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

LINKS

N. Baxter, Panex Puzzle Resources.

FORMULA

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

CROSSREFS

Cf. A109175.

Sequence in context: A023654 A062445 A009304 this_sequence A091107 A133469 A075714

Adjacent sequences: A115182 A115183 A115184 this_sequence A115186 A115187 A115188

KEYWORD

nonn

AUTHOR

njas, Apr 11 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research