Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079768 Number of positions that are exactly n moves from the starting position in the Rainbow Cube puzzle. +0
1
1, 16, 160, 1408, 11712, 90912, 644756, 4070826, 21433009, 76410122, 109897795, 26611502, 328215, 366 (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 239500800.

Calculated by Claude Crepeau and Thanh Vinh Nguyen.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Adjacent sequences: A079765 A079766 A079767 this_sequence A079769 A079770 A079771

Sequence in context: A073394 A038846 A079767 this_sequence A053410 A000811 A041484

KEYWORD

nonn,fini,full

AUTHOR

njas, 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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research