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!)
 A110215 Inequivalent coverings of a cubic board with the minimal number of knights. 2
 1, 1, 1, 8, 37 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS This sequence is a 3-dimensional 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 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)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 11 21:35 EDT 2021. Contains 343808 sequences. (Running on oeis4.)