|
|
A110216
|
|
Total number of coverings of a cubic board with the minimal number of knights.
|
|
3
|
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
Sequence A110214 gives minimal number of knights needed to cover an n X n X n board. This sequence gives total number of solutions using A110214(n) knights.
|
|
EXAMPLE
|
a(3) = 12, since reflections or rotations of
OOO KKK OOO
OKO OKO OKO
OOO OOO OOO generate twelve different coverings.
|
|
CROSSREFS
|
This sequence is a 3-dimensional analog of A103315. a(n) = A110219(n, n, n). A102215 gives the number of inequivalent solutions.
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005
|
|
STATUS
|
approved
|
|
|
|