Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080558
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080558 Number of positions that are exactly n moves from the starting position in the Luminations Level 5 puzzle. +0
13
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; listen)
OFFSET

0,1

COMMENT

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

Cf. A080546-A080557.

Sequence in context: A159308 A163189 A116846 this_sequence A116844 A116851 A038989

Adjacent sequences: A080555 A080556 A080557 this_sequence A080559 A080560 A080561

KEYWORD

nonn,fini,full

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research