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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3

%I

%S 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 2,8,37,1,1,451,1,33,1,1,55,1,220,16,3,12,5

%N 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 Cone starts:

%e 1..1.....1........1.............1..................1........................

%e ...1,.1..2,.6.....7,.103........2,.196.............1,.451

%e .........2,.3,.1..6,..10,.3.....2,...5,.2..........1,..33,..1

%e ..................3,...2,.1,.8..2,...1,.1,.3.......1,..55,..1,.220

%e ................................8,...1,.2,.8,.37..16,...3,.12,...5,.?

%e ..................................................23,...2,..4,...?,....

%Y C(n, n, 1) = A006076(n), C(n, n, n) = A110215(n). A110219 gives total number of solutions.

%K hard,nonn,tabl

%O 1,6

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

Last modified May 10 03:11 EDT 2021. Contains 343747 sequences. (Running on oeis4.)