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 A110219 #5 Jun 12 2022 06:44:56 %S A110219 1,1,1,1,1,4,36,8,12,12,1,16,1296,15,56,14,9,16,8,156,1,4,2916,6,24,8, %T A110219 3,4,2,6,47,2,8,38,888,1,1,6561,2,236,2,1,268,1,2988,46,4,27,7 %N A110219 Cone C(n,m,k) read by planes and rows, for 1 <= k <= m <= n: Total Number of coverings of a k X m X n board using A110217(n,m,k) knights. %e A110219 Cone starts: %e A110219 1.1...1........1..............1.................1...................... %e A110219 ..1,1.4,36....16,1296.........4,2916............1,6561. %e A110219 ......8,12,12.15,..56,14......6,..24,8..........2,.236,.2 %e A110219 ...............9,..16,.8,156..3,...4,2,.6.......1,.268,.1,2988 %e A110219 .............................47,...2,8,38,888..46,...4,27,...7,.? %e A110219 ..............................................127,..32,12,...?,.... %Y A110219 C(n, n, 1) = A103315(n), C(n, n, n) = A110216(n). A110218 gives number of inequivalent solutions. %K A110219 hard,nonn,tabf %O A110219 1,6 %A A110219 Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005