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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080554 Number of positions that are exactly n moves from the starting position in the Luminations Level 4 puzzle. 0
1, 3, 6, 13, 19, 34, 44, 70, 85, 125, 146, 203, 231, 260, 251, 245, 208, 183, 121, 78, 38, 21, 10, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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 2401. Here positions differing by rotations or reflections are considered distinct.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A137035 A137042 A080546 * A064349 A101965 A230370

Adjacent sequences:  A080551 A080552 A080553 * A080555 A080556 A080557

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

Content is available under The OEIS End-User License Agreement .

Last modified April 18 04:10 EDT 2014. Contains 240688 sequences.