The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A251530 revision #5

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

(list; graph; refs; listen; history; text; internal format)

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