login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080564 Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle. 5
1, 24, 30, 12, 180, 492, 735, 1460, 1101, 60 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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 4096.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A010928, A080560-A080563.

Sequence in context: A319901 A058228 A093455 * A048260 A114635 A077969

Adjacent sequences:  A080561 A080562 A080563 * A080565 A080566 A080567

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 January 17 18:14 EST 2020. Contains 330987 sequences. (Running on oeis4.)