The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079744 Number of positions that are exactly n moves from the starting position in the Pyraminx puzzle. 0
1, 8, 48, 288, 1728, 9896, 51808, 220111, 480467, 166276, 2457, 32 (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 933120. The trivial turns of the tips are ignored.
If tips are included the total number of positions is 933120 * 3^4 = 75582720.
REFERENCES
Computed by John Francis and Louis Robichaud.
D. R. Hofstadter, Metamagical Themas, Basic Books, NY, 1985, p. 358.
LINKS
Jaap Scherphuis, Puzzle Pages
CROSSREFS
Sequence in context: A231109 A079743 A079765 * A079746 A079745 A079758
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 09:27 EDT 2024. Contains 373472 sequences. (Running on oeis4.)