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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079817 Number of positions that are exactly n moves from the starting position in the Roundy puzzle. 1
1, 9, 54, 261, 919, 1246, 378, 12 (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 2880. Here we count half-turn moves.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A079742.

Sequence in context: A327387 A282920 A023008 * A169796 A027472 A022637

Adjacent sequences:  A079814 A079815 A079816 * A079818 A079819 A079820

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 20 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 December 12 22:06 EST 2019. Contains 329963 sequences. (Running on oeis4.)