Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080551
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080551 Number of positions that are exactly n moves from the starting position in the Luminations Level 2 puzzle. +0
1
1, 1, 2, 5, 10, 15, 22, 24, 26, 22, 19, 12, 9, 4, 3 (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 175. Here positions differing by rotations or reflections are considered the same.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Adjacent sequences: A080548 A080549 A080550 this_sequence A080552 A080553 A080554

Sequence in context: A109666 A024390 A125622 this_sequence A008822 A013927 A099738

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research