login
This site is supported by donations 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. 1
1, 6, 27, 120, 534, 2256, 8969, 33058, 114149, 360508, 930588, 1350852, 782536, 90280, 276 (list; graph; refs; listen; history; 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 3674160. A half-turn is considered to be two moves.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A080619 A080620 A080627 * A175716 A178935 A002912

Adjacent sequences:  A079759 A079760 A079761 * A079763 A079764 A079765

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 20 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 17:06 EST 2012. Contains 205432 sequences.