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

318659, 11314071, 463425639, 17145057973, 629694824303, 23667617769817, 891996903006527, 33481355214548009, 1258684591767307311, 47365710615235761413, 1782764221799264814205, 67097943667181977772419

Offset

1,1

Comments

Column 3 of A251531.

Links

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

Example

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

Crossrefs

Cf. A251531.

Sequence in context: A153749 A186623 A202468 * A253341 A210317 A205931

Adjacent sequences: A251525 A251526 A251527 * A251529 A251530 A251531

Keyword

nonn

Author

R. H. Hardin, Dec 04 2014

Status

approved