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 A110217 #7 Jun 12 2022 06:45:13 %S A110217 1,2,4,8,3,4,8,4,6,6,4,4,8,4,6,6,4,6,7,8,5,4,8,4,6,6,4,6,7,8,5,6,8,10, %T A110217 13,6,4,6,4,7,6,4,8,8,12,6,8,10,12 %N A110217 Cone C(n,m,k) read by planes and rows, for 1 <= k <= m <= n: minimal number of knights needed to cover a k X m X n board. %F A110217 How many knights with move vector (2, 1, 0) are needed to occupy or attack every field of a k X m X n board? Knights may attack each other. %e A110217 Cone starts: %e A110217 1..2....3......4........5............6................. %e A110217 ...4.8..4.8....4.8......4.8..........4..6 %e A110217 ........4.6.6..4.6.6....4.6.6........4..7..6 %e A110217 ...............4.6.7.8..4.6.7..8.....4..8..8.12 %e A110217 ........................5.6.8.10.13..6..8.10.12.? %e A110217 .....................................8.11.12..?.... %Y A110217 C(n, n, 1) = A006075(n), C(n, k, 1) = A098604(n, k), C(n, n, n) = A110214(n). A110218 gives number of inequivalent ways to cover the board using C(n, m, k) knights, A110219 gives total number. %K A110217 hard,nonn,tabf %O A110217 1,2 %A A110217 Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005