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

 

Logo


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

%I

%S 1,1,12,156,888

%N Total number of coverings of a cubic board with the minimal number of knights.

%F 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.

%e a(3) = 12, since reflections or rotations of

%e OOO KKK OOO

%e OKO OKO OKO

%e OOO OOO OOO generate twelve different coverings.

%Y This sequence is a 3-dimensional analog of A103315. a(n) = A110219(n, n, n). A102215 gives the number of inequivalent solutions.

%K hard,nonn

%O 1,3

%A Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 11 15:49 EDT 2021. Contains 342886 sequences. (Running on oeis4.)