Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080561
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080561 Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. +0
1
1, 1, 3, 5, 10, 12, 18, 12, 10, 5, 3, 1, 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 82. Here positions differing by rotations or reflections are considered the same.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A010928, A080560-A080564.

Adjacent sequences: A080558 A080559 A080560 this_sequence A080562 A080563 A080564

Sequence in context: A119133 A047389 A093661 this_sequence A007557 A034746 A080931

KEYWORD

nonn,fini,full

AUTHOR

njas, 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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research