Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080583
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080583 Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves. +0
4
1, 18, 262, 3502, 46741, 621649, 8240087 (list; graph; listen)
OFFSET

0,2

COMMENT

This is different from the sequence giving the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves (A080601).

A half-turn is considered to be a single move (rather than two moves).

The total number of positions is 901083404981813616.

Relationship with A080601: 243 = 262 - 18 - 1, 3240 = 3502 - 262, 43239 = 46741 - 3502, ...

LINKS

Mark Longridge, God's Algorithm Calculations for Rubik's Cube...

CROSSREFS

Cf. A080601, A080602.

Adjacent sequences: A080580 A080581 A080582 this_sequence A080584 A080585 A080586

Sequence in context: A062141 A136660 A078205 this_sequence A076693 A083445 A115903

KEYWORD

nonn,more

AUTHOR

Alex Healy (ahealy(AT)fas.harvard.edu), Feb 21 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 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research