login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080549 Number of positions that are exactly n moves from the starting position in the Luminations Level 2 puzzle. 0

%I

%S 1,3,9,21,43,61,88,90,96,77,63,34,26,8,5

%N Number of positions that are exactly n moves from the starting position in the Luminations Level 2 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 625. Here positions differing by rotations or reflections are considered distinct.

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

%Y Cf. A080546-A080558.

%K nonn,fini,full

%O 0,2

%A _N. J. A. Sloane_, Feb 21 2003

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 14:52 EST 2016. Contains 278877 sequences.