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

 

Logo


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
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; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..49.

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: A171898 A330541 A320575 * A316259 A057892 A334188

Adjacent sequences:  A110215 A110216 A110217 * A110219 A110220 A110221

KEYWORD

hard,nonn,tabl

AUTHOR

Nikolaus Meyberg (Nikolaus.Meyberg(AT)t-online.de), Jul 17 2005

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 13:31 EDT 2021. Contains 343063 sequences. (Running on oeis4.)