|
| |
|
|
A010928
|
|
Binomial coefficient C(12,n).
|
|
6
|
|
|
|
1, 12, 66, 220, 495, 792, 924, 792, 495, 220, 66, 12, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
Also number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. 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 4096. Here positions differing by rotations or reflections are considered distinct.
If the sequence is extended by trailing zeros, its binomial transform yields A010965. - R. J. Mathar, Sep 19 2008
|
|
|
LINKS
|
|
|
|
MAPLE
|
|
|
|
MATHEMATICA
|
|
|
|
PROG
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,fini,full,easy
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
