|
Search: id:A110218
|
|
|
| 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. |
|
+0
4
|
|
| 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, 2, 8, 37, 1, 1, 451, 1, 33, 1, 1, 55, 1, 220, 16, 3, 12, 5
(list; table; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
EXAMPLE
|
Cone starts:
1..1.....1........1.............1..................1........................
...1,.1..2,.6.....7,.103........2,.196.............1,.451
.........2,.3,.1..6,..10,.3.....2,...5,.2..........1,..33,..1
..................3,...2,.1,.8..2,...1,.1,.3.......1,..55,..1,.220
................................8,...1,.2,.8,.37..16,...3,.12,...5,.?
..................................................23,...2,..4,...?,....
|
|
CROSSREFS
|
C(n, n, 1) = A006076(n), C(n, n, n) = A110215(n). A110219 gives total number of solutions.
Sequence in context: A008905 A136760 A062539 this_sequence A057892 A115009 A151944
Adjacent sequences: A110215 A110216 A110217 this_sequence A110219 A110220 A110221
|
|
KEYWORD
|
hard,nonn,tabl
|
|
AUTHOR
|
Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005
|
|
|
Search completed in 0.002 seconds
|
