Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080549
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080549 Number of positions that are exactly n moves from the starting position in the Luminations Level 2 puzzle. +0
1
1, 3, 9, 21, 43, 61, 88, 90, 96, 77, 63, 34, 26, 8, 5 (list; graph; listen)
OFFSET

0,2

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

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A146608 A161214 A011843 this_sequence A084569 A110964 A107351

Adjacent sequences: A080546 A080547 A080548 this_sequence A080550 A080551 A080552

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research