cp's OEIS Frontend

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.

Showing 1-3 of 3 results.

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.

Original entry on oeis.org

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
Offset: 1

Views

Author

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

Keywords

Examples

			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.

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.

Original entry on oeis.org

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

Views

Author

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

Keywords

Examples

			Cone starts:
1.1...1........1..............1.................1......................
..1,1.4,36....16,1296.........4,2916............1,6561.
......8,12,12.15,..56,14......6,..24,8..........2,.236,.2
...............9,..16,.8,156..3,...4,2,.6.......1,.268,.1,2988
.............................47,...2,8,38,888..46,...4,27,...7,.?
..............................................127,..32,12,...?,....

Crossrefs

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

A110214 Minimal number of knights to cover a cubic board.

Original entry on oeis.org

1, 8, 6, 8, 13
Offset: 1

Views

Author

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

Keywords

Examples

			Illustration for n = 3, 4, 5 ( O = empty field, K = knight ):
n = 3: OOO KKK OOO n = 4: OOOO OKOO OOOO OOOO
...... OKO OKO OKO ...... OOOO OKKK OOOO OOOO
...... OOO OOO OOO ...... OOOO KKKO OOOO OOOO
......................... OOOO OOKO OOOO OOOO
n = 5: 1, 2, 4 and 5 planes empty, 3 plane: OKOKO OKOKO KKKKK KOKOK OOKOO.

Crossrefs

This is a 3-dimensional version of A006075. a(n) = A110217(n, n, n). A110215 gives number of inequivalent ways to cover the board using a(n) knights, A110216 gives total number.

Formula

Generalize a knight for a spatial board: a move consists of two steps in the first, one step in the second and no step in the third dimension. How many of such knights are needed to occupy or attack every field of an n X n X n board? Knights may attack each other.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.