This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A110215 #13 Apr 22 2021 15:41:58 %S A110215 1,1,1,8,37 %N A110215 Inequivalent coverings of a cubic board with the minimal number of knights. %C A110215 This sequence is a 3-dimensional analog of A006076. %C A110215 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. %F A110215 a(n) = A110218(n, n, n). %e A110215 a(3) = 1, since up to rotations and reflections, %e A110215 OOO KKK OOO %e A110215 OKO OKO OKO %e A110215 OOO OOO OOO is the only covering for n = 3. %Y A110215 Cf. A006076, A110214, A110218. %Y A110215 A110216 gives total number of solutions. %K A110215 hard,more,nonn %O A110215 1,4 %A A110215 Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005