Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079839
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079839 Number of positions that are exactly n moves from the starting position in the Billiards Nine-Ball puzzle. +0
2
1, 6, 24, 91, 329, 1169, 3992, 13122, 41437, 124205, 343276, 811477, 1328627, 882408, 78441, 195 (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 3628800. A move is single shift of one of the three loops in any direction.

LINKS

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A006780 A001352 A155602 this_sequence A002023 A164908 A037505

Adjacent sequences: A079836 A079837 A079838 this_sequence A079840 A079841 A079842

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research