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.

A110217 Cone C(n,m,k) read by planes and rows, for 1 <= k <= m <= n: minimal number of knights needed to cover a k X m X n board.

Original entry on oeis.org

1, 2, 4, 8, 3, 4, 8, 4, 6, 6, 4, 4, 8, 4, 6, 6, 4, 6, 7, 8, 5, 4, 8, 4, 6, 6, 4, 6, 7, 8, 5, 6, 8, 10, 13, 6, 4, 6, 4, 7, 6, 4, 8, 8, 12, 6, 8, 10, 12
Offset: 1

Views

Author

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

Keywords

Examples

			Cone starts:
1..2....3......4........5............6.................
...4.8..4.8....4.8......4.8..........4..6
........4.6.6..4.6.6....4.6.6........4..7..6
...............4.6.7.8..4.6.7..8.....4..8..8.12
........................5.6.8.10.13..6..8.10.12.?
.....................................8.11.12..?....

Crossrefs

C(n, n, 1) = A006075(n), C(n, k, 1) = A098604(n, k), C(n, n, n) = A110214(n). A110218 gives number of inequivalent ways to cover the board using C(n, m, k) knights, A110219 gives total number.

Formula

How many knights with move vector (2, 1, 0) are needed to occupy or attack every field of a k X m X n board? Knights may attack each other.

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.

A110215 Inequivalent coverings of a cubic board with the minimal number of knights.

Original entry on oeis.org

1, 1, 1, 8, 37
Offset: 1

Views

Author

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

Keywords

Comments

This sequence is a 3-dimensional analog of A006076.
Sequence A110214 gives minimal number of knights needed to cover an n X n X n board. This sequence gives the number of inequivalent solutions to cover an n X n X n board using A110214(n) knights.

Examples

			a(3) = 1, since up to rotations and reflections,
OOO KKK OOO
OKO OKO OKO
OOO OOO OOO is the only covering for n = 3.

Crossrefs

Cf. A006076, A110214, A110218.
A110216 gives total number of solutions.

Formula

a(n) = A110218(n, n, n).
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.