Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080563
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080563 Number of positions that are exactly n moves from the starting position in the Orbix Type 3 puzzle. +0
2
1, 12, 30, 140, 291, 440, 660, 792, 727, 572, 302, 92, 37 (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 4079.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A010928, A080560-A080564.

Sequence in context: A110019 A069486 A117313 this_sequence A005147 A007308 A065138

Adjacent sequences: A080560 A080561 A080562 this_sequence A080564 A080565 A080566

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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 December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research