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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079844 Number of positions that are exactly n moves from the starting position in the Rashkey Type 1 puzzle. 1
1, 4, 10, 24, 58, 136, 293, 652, 1474, 3176, 6448, 10518, 12571, 7581, 1130, 24 (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 44100. Here we consider a move to be a quarter turn of a disc.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A079843.

Sequence in context: A118871 A019494 A192886 * A080617 A080628 A225127

Adjacent sequences:  A079841 A079842 A079843 * A079845 A079846 A079847

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 21 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 August 29 05:24 EDT 2015. Contains 261185 sequences.