The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

(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
1, 6, 27, 120, 534, 2256, 8969, 33058, 114149, 360508, 930588, 1350852, 782536, 90280, 276 (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 3674160. A half-turn is considered to be two moves.


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

Mark Longridge, God's Algorithm Calculations for Rubik's Cube...

Jaap Scherphuis, Puzzle Pages


Cf. A079761, A152169.

Sequence in context: A265943 A080620 A080627 * A175716 A178935 A249792

Adjacent sequences:  A079759 A079760 A079761 * A079763 A079764 A079765




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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 20:56 EST 2020. Contains 338920 sequences. (Running on oeis4.)