Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080553 Number of positions that are exactly n moves from the starting position in the Luminations Level 3 puzzle. +0
1
2, 2, 3, 5, 9, 13, 15, 25, 36, 46, 45, 69, 88, 113, 97, 146, 175, 223, 179, 264, 307, 133, 43, 11, 3 (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 2052. Here positions differing by rotations are considered the same.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A039822 A025591 A028409 this_sequence A130377 A049873 A127180

Adjacent sequences: A080550 A080551 A080552 this_sequence A080554 A080555 A080556

KEYWORD

nonn,fini,full

AUTHOR

njas, 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research