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!)
A079830 Number of positions that are exactly n moves from the starting position in the Rubik's Cheese puzzle. 1
1, 3, 6, 12, 18, 24, 23, 9 (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 96.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A239708 A038588 A111041 * A160744 A160738 A028882

Adjacent sequences:  A079827 A079828 A079829 * A079831 A079832 A079833

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 | 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 December 18 21:27 EST 2014. Contains 252174 sequences.