# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a110214
Showing 1-1 of 1

%I A110214 #3 Feb 27 2009 03:00:00
%S A110214 1,8,6,8,13
%N A110214 Minimal number of knights to cover a cubic board.
%F A110214 Generalize a knight for a spatial board: a move consists of two steps in the first, one step in the second and no step in the third dimension. How many of such knights are needed to occupy or attack every field of an n X n X n board? Knights may attack each other.
%e A110214 Illustration for n = 3, 4, 5 ( O = empty field, K = knight ):
%e A110214 n = 3: OOO KKK OOO n = 4: OOOO OKOO OOOO OOOO
%e A110214 ...... OKO OKO OKO ...... OOOO OKKK OOOO OOOO
%e A110214 ...... OOO OOO OOO ...... OOOO KKKO OOOO OOOO
%e A110214 ......................... OOOO OOKO OOOO OOOO
%e A110214 n = 5: 1, 2, 4 and 5 planes empty, 3 plane: OKOKO OKOKO KKKKK KOKOK OOKOO.
%Y A110214 This is a 3-dimensional version of A006075. a(n) = A110217(n, n, n). A110215 gives number of inequivalent ways to cover the board using a(n) knights, A110216 gives total number.
%K A110214 hard,nonn
%O A110214 1,2
%A A110214 Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE