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

 

Logo

The October issue of the Notices of the Amer. Math. Soc. has an article about the OEIS.

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

Table of n, a(n) for n=0..24.

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A294861 A161664 A080547 * A024924 A023668 A023564

Adjacent sequences:  A080552 A080553 A080554 * A080556 A080557 A080558

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 19:04 EDT 2018. Contains 315270 sequences. (Running on oeis4.)