Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A156022 A048171 A090178 this_sequence A080556 A064985 A090631

Adjacent sequences: A080545 A080546 A080547 this_sequence A080549 A080550 A080551

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