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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079769 Number of positions that are exactly n moves from the starting position in the Bandaged Pyraminx puzzle. 0
1, 4, 12, 32, 76, 206, 510, 1126, 1803, 1980, 981, 165, 15, 1 (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 6912.

The tips are ignored. The antipode at distance 13 is the position with all 4 free edges flipped.

LINKS

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A004403 A084566 A208903 * A107035 A260145 A260778

Adjacent sequences:  A079766 A079767 A079768 * A079770 A079771 A079772

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 05:18 EST 2016. Contains 278773 sequences.