

A110215


Inequivalent coverings of a cubic board with the minimal number of knights.


2




OFFSET

1,4


COMMENTS

This sequence is a 3dimensional analog of A006076.
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.


LINKS

Table of n, a(n) for n=1..5.


FORMULA

a(n) = A110218(n, n, n).


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

Cf. A006076, A110214, A110218.
A110216 gives total number of solutions.
Sequence in context: A276175 A050536 A261846 * A281465 A302619 A302411
Adjacent sequences: A110212 A110213 A110214 * A110216 A110217 A110218


KEYWORD

hard,more,nonn


AUTHOR

Nikolaus Meyberg (Nikolaus.Meyberg(AT)tonline.de), Jul 17 2005


STATUS

approved



