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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090574 Number of configurations 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 in the center of the combination cube. 3
1, 6, 24, 72, 192, 624, 2004, 6504, 19776, 62760, 186000, 583712, 1720972 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

See under A090573.

LINKS

Table of n, a(n) for n=0..12.

EXAMPLE

a(1)=6 because the empty space in the center of the cube present in the assumed initial configuration can be replaced by any of the 6 adjacent cubes from the face centers in the first move.

CROSSREFS

A090572 2 X 2 X 2 puzzle, A090573, A090575, A090576 3 X 3 X 3 puzzle with different initial configurations.

Sequence in context: A006528 A052749 A262445 * A294842 A290132 A225383

Adjacent sequences:  A090571 A090572 A090573 * A090575 A090576 A090577

KEYWORD

fini,hard,more,nonn

AUTHOR

Hugo Pfoertner, Jan 15 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 22 03:55 EST 2018. Contains 299428 sequences. (Running on oeis4.)