|
| |
|
|
A110215
|
|
Inequivalent coverings of a cubic board with the minimal number of knights.
|
|
2
| | |
|
|
|
OFFSET
| 1,4
|
|
|
FORMULA
| Sequence A110214 gives minimal number of knights needed to cover an n X n X n board. This sequence gives the number of inequivalent solutions to cover an n X n X n board using A110214(n) knights.
|
|
|
EXAMPLE
| a(3) = 1, since up to rotations and reflections,
OOO KKK OOO
OKO OKO OKO
OOO OOO OOO is the only covering for n = 3.
|
|
|
CROSSREFS
| This sequence is a 3-dimensional analogue of A006076. a(n) = A110218(n, n, n). A110216 gives total number of solutions.
Sequence in context: A058823 A203020 A050536 * A052387 A001780 A053296
Adjacent sequences: A110212 A110213 A110214 * A110216 A110217 A110218
|
|
|
KEYWORD
| hard,nonn
|
|
|
AUTHOR
| Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005
|
| |
|
|
