login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #5 Jun 12 2022 06:44:56

%S 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 3,4,2,6,47,2,8,38,888,1,1,6561,2,236,2,1,268,1,2988,46,4,27,7

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

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

%e ..1,1.4,36....16,1296.........4,2916............1,6561.

%e ......8,12,12.15,..56,14......6,..24,8..........2,.236,.2

%e ...............9,..16,.8,156..3,...4,2,.6.......1,.268,.1,2988

%e .............................47,...2,8,38,888..46,...4,27,...7,.?

%e ..............................................127,..32,12,...?,....

%Y C(n, n, 1) = A103315(n), C(n, n, n) = A110216(n). A110218 gives number of inequivalent solutions.

%K hard,nonn,tabf

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:08 EDT 2024. Contains 371945 sequences. (Running on oeis4.)