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!)
A080552 Number of positions that are exactly n moves from the starting position in the Luminations Level 3 puzzle. 0
3, 4, 5, 9, 16, 26, 28, 45, 66, 91, 87, 125, 164, 224, 190, 268, 331, 441, 353, 491, 583, 245, 75, 15, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
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 3888. Here positions differing by rotations or reflections are considered distinct.
LINKS
Jaap Scherphuis, Puzzle Pages
CROSSREFS
Sequence in context: A117125 A000692 A195971 * A215176 A063781 A257041
KEYWORD
nonn,fini,full
AUTHOR
N. J. A. Sloane, Feb 21 2003
STATUS
approved

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 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)