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!)
A079857 Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle. 1
1, 3, 9, 25, 71, 213, 637, 1871, 5439, 15591, 43853, 119603, 306107, 694105, 1253721, 1481631, 862893, 169269, 6192, 16 (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 4961250. Here we consider a move to be a turn of a disc by any amount.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A079864.

Sequence in context: A211295 A211289 A211292 * A211282 A211298 A138574

Adjacent sequences:  A079854 A079855 A079856 * A079858 A079859 A079860

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 July 31 21:42 EDT 2014. Contains 245088 sequences.