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 A110218 #5 Jun 12 2022 06:45:02 %S A110218 1,1,1,1,1,2,6,2,3,1,1,7,103,6,10,3,3,2,1,8,1,2,196,2,5,2,2,1,1,3,8,1, %T A110218 2,8,37,1,1,451,1,33,1,1,55,1,220,16,3,12,5 %N A110218 Cone C(n,m,k) read by planes and rows, for 1 <= k <= m <= n: Number of inequivalent coverings of a k X m X n board using A110217(n,m,k) knights. %e A110218 Cone starts: %e A110218 1..1.....1........1.............1..................1........................ %e A110218 ...1,.1..2,.6.....7,.103........2,.196.............1,.451 %e A110218 .........2,.3,.1..6,..10,.3.....2,...5,.2..........1,..33,..1 %e A110218 ..................3,...2,.1,.8..2,...1,.1,.3.......1,..55,..1,.220 %e A110218 ................................8,...1,.2,.8,.37..16,...3,.12,...5,.? %e A110218 ..................................................23,...2,..4,...?,.... %Y A110218 C(n, n, 1) = A006076(n), C(n, n, n) = A110215(n). A110219 gives total number of solutions. %K A110218 hard,nonn,tabf %O A110218 1,6 %A A110218 Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005