Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,3

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 833. Here positions differing by rotations are considered the same.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A001318 A024702 A080547 this_sequence A024924 A023668 A023564

Adjacent sequences: A080552 A080553 A080554 this_sequence A080556 A080557 A080558

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research