Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090574
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
4
1, 6, 24, 72, 192, 624, 2004, 6504, 19776, 62760, 186000, 583712, 1720972 (list; graph; listen)
OFFSET

0,2

COMMENT

See under A090573.

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: A092348 A006528 A052749 this_sequence A080373 A058809 A140088

Adjacent sequences: A090571 A090572 A090573 this_sequence A090575 A090576 A090577

KEYWORD

fini,hard,more,nonn

AUTHOR

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

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research