login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080561 Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. 0
1, 1, 3, 5, 10, 12, 18, 12, 10, 5, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

Table of n, a(n) for n=0..12.

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A010928, A080560-A080564.

Sequence in context: A263652 A285679 A093661 * A266663 A007557 A034746

Adjacent sequences:  A080558 A080559 A080560 * A080562 A080563 A080564

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 21 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 25 01:17 EDT 2019. Contains 321450 sequences. (Running on oeis4.)