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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090576 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 at mid-side of one of the 12 edges of the combination cube. 6
1, 4, 12, 40, 128, 412, 1251, 4026, 12362, 39624, 120012, 379132, 1130914 (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)=4 because the empty space located at mid-edge of one of the 12 edges of the assumed initial configuration can be replaced in the first move by any of the adjacent 2 cubes from the same edge or by the adjacent mid-face cubes of the 2 faces forming this edge.

CROSSREFS

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

Sequence in context: A058353 A104525 A126986 * A152174 A087206 A275863

Adjacent sequences:  A090573 A090574 A090575 * A090577 A090578 A090579

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 November 19 08:40 EST 2018. Contains 317347 sequences. (Running on oeis4.)