OFFSET
0,2
COMMENTS
I.e., closed walks of length 2n from a fixed vertex on the Cayley graph of the cube with {F, F^(-1), R, R^(-1), B, B^(-1), L, L^(-1) U, U^(-1), D, D^(-1)} as the set of generators. Alternatively, the n-th term is equal to the sum of the n-th powers of the eigenvalues of this Cayley graph divided by the order of the Rubik's cube group, ~4.3*10^19 (see A054434).
EXAMPLE
There are 12 closed walks of length 2: F*F^(-1), F^(-1)*F, R*R^(-1), R^(-1)*R, ..., D*D^(-1), D^(-1)*D.
CROSSREFS
KEYWORD
hard,nonn,more
AUTHOR
Alexander D. Healy, Mar 15 2001
STATUS
approved