Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A080558 Number of positions that are exactly n moves from the starting position in the Luminations Level 5 puzzle. 12
2, 5, 14, 41, 114, 256, 464, 630, 812, 914, 1018, 1056, 1072, 1011, 878, 670, 504, 322, 218, 111, 64, 21, 9 (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 10206. Here positions differing by rotations are considered the same.
LINKS
Jaap Scherphuis, Puzzle Pages
CROSSREFS
Sequence in context: A358416 A225691 A116846 * A116844 A116851 A038989
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 August 18 23:05 EDT 2024. Contains 375284 sequences. (Running on oeis4.)