The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A080549 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A080549

Number of positions that are exactly n moves from the starting position in the Luminations Level 2 puzzle.
(history; published version)

#5 by R. J. Mathar at Wed Dec 11 07:14:03 EST 2013

STATUS

editing

approved

#4 by R. J. Mathar at Wed Dec 11 07:14:00 EST 2013

LINKS

Jaap Scherphuis, <a href="http://www.geocities.com/jaapsch.net/puzzles/">Puzzle Pages</a>

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 16:49:39 EDT 2012

AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com), _, Feb 21 2003

Discussion

Fri Mar 30

16:49

OEIS Server: https://oeis.org/edit/global/110

#2 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

KEYWORD

nonn,fini,full,new

AUTHOR

N. J. A. Sloane (njas, (AT)research.att.com), Feb 21 2003

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

Number of positions that are exactly n moves from the starting position in the Luminations Level 2 puzzle.

DATA

1, 3, 9, 21, 43, 61, 88, 90, 96, 77, 63, 34, 26, 8, 5

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

LINKS

Jaap Scherphuis, <a href="http://www.geocities.com/jaapsch/puzzles/">Puzzle Pages</a>

CROSSREFS

Cf. A080546-A080558.

KEYWORD

nonn,fini,full

AUTHOR

njas, Feb 21 2003

STATUS

approved