This site is supported by donations to The OEIS Foundation.



Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079864 Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle. 1
1, 2, 5, 12, 29, 67, 160, 385, 920, 2191, 5191, 12228, 28401, 64826, 143540, 303171, 588027, 980723, 1256693, 1049406, 449402, 72968, 2888, 14 (list; graph; refs; listen; history; text; internal format)



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 4961250. Here we consider a move to be a quarter turn of a disc.


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

Jaap Scherphuis, Puzzle Pages


Cf. A079857.

Sequence in context: A162036 A232534 A062422 * A131045 A182555 A026721

Adjacent sequences:  A079861 A079862 A079863 * A079865 A079866 A079867




N. J. A. Sloane, Feb 21 2003



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 December 20 15:14 EST 2014. Contains 252266 sequences.