The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A080555 Number of positions that are exactly n moves from the starting position in the Luminations Level 4 puzzle. 0
1, 1, 2, 5, 7, 12, 16, 24, 29, 43, 50, 69, 79, 88, 85, 85, 72, 63, 43, 28, 14, 9, 4, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
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 833. Here positions differing by rotations are considered the same.
LINKS
Jaap Scherphuis, Puzzle Pages
CROSSREFS
Sequence in context: A294861 A161664 A080547 * A320657 A024924 A359339
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 May 20 11:55 EDT 2024. Contains 372712 sequences. (Running on oeis4.)