A251530 Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (5+2) board.

31361437, 4060878845, 629694824303, 85453027245665, 11726484486571601, 1671396405843418205, 239415740786170785059, 34268623489221568471683, 4926792732223129880488261, 710174571545415147604020125

Offset

1,1

Comments

Column 5 of A251531.

Links

R. H. Hardin, Table of n, a(n) for n = 1..11

Example

Some solutions for n=1
..0..0..0..1..1..0..0....0..0..0..0..0..0..2....0..0..0..0..0..0..2
..0..0..0..0..0..0..1....0..0..0..2..2..2..1....0..0..0..1..0..0..2
..0..0..0..0..1..0..0....0..0..0..2..1..0..0....0..0..2..2..2..0..0

Crossrefs

Cf. A251531.

Sequence in context: A203276 A182088 A209786 * A125574 A215414 A151621

Adjacent sequences: A251527 A251528 A251529 * A251531 A251532 A251533

Keyword

nonn

Author

R. H. Hardin, Dec 04 2014

Status

approved