login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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. 4

%I #10 Aug 16 2015 12:02:59

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

%Y Cf. A079761, A152169.

%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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 15 20:47 EDT 2024. Contains 371696 sequences. (Running on oeis4.)