Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080546
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080546 Number of positions that are exactly n moves from the starting position in the Luminations Level 1 puzzle. +0
13
1, 3, 6, 13, 19, 34, 44, 70, 85, 95, 86, 77, 49, 27, 10, 4, 1 (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 and reflections are considered distinct.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A080547-A080558.

Sequence in context: A137039 A137035 A137042 this_sequence A080554 A064349 A101965

Adjacent sequences: A080543 A080544 A080545 this_sequence A080547 A080548 A080549

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