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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079843 Number of positions that are exactly n moves from the starting position in the Rashkey Type 1 puzzle. 1
1, 6, 18, 53, 148, 416, 1144, 3060, 7135, 12959, 14050, 4858, 252 (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 turn of a disc by any amount.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A079844.

Sequence in context: A075650 A015645 A001216 * A076941 A006779 A003208

Adjacent sequences:  A079840 A079841 A079842 * A079844 A079845 A079846

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 October 2 02:22 EDT 2014. Contains 247527 sequences.