Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080550
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080550 Number of positions that are exactly n moves from the starting position in the Luminations Level 2 puzzle. +0
1
1, 1, 3, 7, 15, 21, 30, 32, 34, 27, 23, 14, 10, 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 225. Here positions differing by rotations are considered the same.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A077777 A153829 A153830 this_sequence A043725 A121712 A139208

Adjacent sequences: A080547 A080548 A080549 this_sequence A080551 A080552 A080553

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research