|
%I #13 Apr 22 2021 15:41:58
%S 1,1,1,8,37
%N Inequivalent coverings of a cubic board with the minimal number of knights.
%C This sequence is a 3-dimensional analog of A006076.
%C 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.
%F a(n) = A110218(n, n, n).
%e a(3) = 1, since up to rotations and reflections,
%e OOO KKK OOO
%e OKO OKO OKO
%e OOO OOO OOO is the only covering for n = 3.
%Y Cf. A006076, A110214, A110218.
%Y A110216 gives total number of solutions.
%K hard,more,nonn
%O 1,4
%A Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005
| 