

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

Table of n, a(n) for n=0..11.
Mark Longridge, God's Algorithm Calculations for Rubik's Cube...
Jaap Scherphuis, Puzzle Pages


CROSSREFS

Sequence in context: A231109 A079743 A079765 * A079746 A079745 A079758
Adjacent sequences: A079741 A079742 A079743 * A079745 A079746 A079747


KEYWORD

nonn,fini,full


AUTHOR

N. J. A. Sloane, Feb 20 2003


STATUS

approved



