Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080562
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080562 Number of positions that are exactly n moves from the starting position in the Orbix Type 2 puzzle. +0
1
1, 12, 36, 80, 185, 300, 475, 480, 312, 152, 51 (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 2079.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Cf. A010928, A080560-A080564.

Adjacent sequences: A080559 A080560 A080561 this_sequence A080563 A080564 A080565

Sequence in context: A043140 A043920 A049598 this_sequence A033196 A060621 A058880

KEYWORD

nonn,fini,full

AUTHOR

njas, 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 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research