The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110216 Total number of coverings of a cubic board with the minimal number of knights. 3
 1, 1, 12, 156, 888 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS FORMULA Sequence A110214 gives minimal number of knights needed to cover an n X n X n board. This sequence gives total number of solutions using A110214(n) knights. EXAMPLE a(3) = 12, since reflections or rotations of OOO KKK OOO OKO OKO OKO OOO OOO OOO generate twelve different coverings. CROSSREFS This sequence is a 3-dimensional analog of A103315. a(n) = A110219(n, n, n). A102215 gives the number of inequivalent solutions. Sequence in context: A005723 A097259 A158546 * A218839 A036276 A003130 Adjacent sequences:  A110213 A110214 A110215 * A110217 A110218 A110219 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 5 18:37 EDT 2021. Contains 343573 sequences. (Running on oeis4.)