Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080557
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080557 Number of positions that are exactly n moves from the starting position in the Luminations Level 5 puzzle. +0
2
3, 9, 27, 81, 225, 507, 912, 1236, 1587, 1782, 1977, 2046, 2070, 1947, 1680, 1275, 951, 600, 402, 201, 114, 36, 15 (list; graph; listen)
OFFSET

0,1

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

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080546-A080558.

Sequence in context: A036143 A006521 A014953 this_sequence A022014 A038002 A133494

Adjacent sequences: A080554 A080555 A080556 this_sequence A080558 A080559 A080560

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research