login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A110215
Inequivalent coverings of a cubic board with the minimal number of knights.
2
1, 1, 1, 8, 37
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.
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
A110216 gives total number of solutions.
Sequence in context: A276175 A050536 A261846 * A281465 A302619 A302411
KEYWORD
hard,more,nonn
AUTHOR
Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005
STATUS
approved