Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060010 Number of 2n-move sequences on a 3 X 3 X 3 Rubik's Cube (only quarter-twists count as moves) that leave the cube unchanged, 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). +0
2
1, 12, 312, 10464, 398208, 16323072, 702465024 (list; graph; listen)
OFFSET

0,2

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

Cf. A054434.

Sequence in context: A054942 A052795 A053064 this_sequence A129583 A080325 A083431

Adjacent sequences: A060007 A060008 A060009 this_sequence A060011 A060012 A060013

KEYWORD

hard,nonn

AUTHOR

Alex Healy (ahealy(AT)fas.harvard.edu), Mar 15 2001

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research