The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110214 Minimal number of knights to cover a cubic board. 3
 1, 8, 6, 8, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA 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. EXAMPLE Illustration for n = 3, 4, 5 ( O = empty field, K = knight ): n = 3: OOO KKK OOO n = 4: OOOO OKOO OOOO OOOO ...... OKO OKO OKO ...... OOOO OKKK OOOO OOOO ...... OOO OOO OOO ...... OOOO KKKO OOOO OOOO ......................... OOOO OOKO OOOO OOOO n = 5: 1, 2, 4 and 5 planes empty, 3 plane: OKOKO OKOKO KKKKK KOKOK OOKOO. CROSSREFS 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. Sequence in context: A247559 A246768 A088541 * A305709 A093721 A091506 Adjacent sequences: A110211 A110212 A110213 * A110215 A110216 A110217 KEYWORD hard,nonn AUTHOR Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 17:49 EST 2022. Contains 358475 sequences. (Running on oeis4.)