Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079769
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079769 Number of positions that are exactly n moves from the starting position in the Bandaged Pyraminx puzzle. +0
1
1, 4, 12, 32, 76, 206, 510, 1126, 1803, 1980, 981, 165, 15, 1 (list; graph; listen)
OFFSET

0,2

COMMENT

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A001934 A004403 A084566 this_sequence A107035 A118885 A097392

Adjacent sequences: A079766 A079767 A079768 this_sequence A079770 A079771 A079772

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 20 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research