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!)
A079762 Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle. 1

%I

%S 1,6,27,120,534,2256,8969,33058,114149,360508,930588,1350852,782536,

%T 90280,276

%N Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle.

%C 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.

%C A puzzle in the Rubik cube family. The total number of distinct positions is 3674160. A half-turn is considered to be two moves.

%H Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a>

%H Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a>

%K nonn,fini,full

%O 0,2

%A _N. J. A. Sloane_, Feb 20 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 September 2 06:03 EDT 2014. Contains 246325 sequences.