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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080560 Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. 6
1, 1, 3, 5, 12, 14, 24, 14, 12, 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 96. Here positions differing by rotations 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: A037221 A182537 A212061 * A151866 A057587 A213036

Adjacent sequences:  A080557 A080558 A080559 * A080561 A080562 A080563

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 26 07:08 EST 2014. Contains 250020 sequences.