login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090577 Number of configurations of a variant of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at one of the enclosing cube corners. 2
1, 3, 9, 24, 72, 174, 519, 1284, 3813, 9300, 27462, 66666, 195674, 470886, 1372946 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

The sliding cube 3 X 3 X 3 puzzle under consideration has a fixed central block and 25 movable blocks that can be shifted in the space between the enclosing holder frame and the central block. A description is given in US patents 3845959 and 6513808.

LINKS

Chih Chung Fang, Cubic Puzzle. US Patent 6513808, filed May 09, 2001

Daniel Kosarek, Three-dimensional block puzzle. US Patent 3845959, filed Nov. 5, 1974

EXAMPLE

a(1)=3 because the empty space at one of the 6 corners in the assumed initial configuration can be replaced by any of the 3 adjacent cubes from the middle of the 3 edges meeting at the empty corner in the first move.

CROSSREFS

Cf. A090578, A091521 this puzzle with different initial configurations, A090572 2X2X2 puzzle, A090573 - A090576 configurations of the 3 X 3 X 3 puzzle with 26 movable blocks.

Sequence in context: A118771 A091587 A018047 * A047114 A103301 A148920

Adjacent sequences:  A090574 A090575 A090576 * A090578 A090579 A090580

KEYWORD

fini,hard,more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 19 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 20:06 EST 2012. Contains 205552 sequences.