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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079768 Number of positions that are exactly n moves from the starting position in the Rainbow Cube puzzle. 0
1, 16, 160, 1408, 11712, 90912, 644756, 4070826, 21433009, 76410122, 109897795, 26611502, 328215, 366 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves.

A puzzle in the Rubik cube family. The total number of distinct positions is 239500800.

Calculated by Claude Crepeau and Thanh Vinh Nguyen.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A073394 A038846 A079767 * A053410 A225591 A197677

Adjacent sequences:  A079765 A079766 A079767 * A079769 A079770 A079771

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 20 2003

STATUS

approved

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

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

Last modified October 22 18:50 EDT 2014. Contains 248400 sequences.