A251527 - OEIS

A251527

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

30377, 546525, 11314071, 216137483, 4060878845, 77906507591, 1498035497513, 28691083120021, 549693762159617, 10541959853810087, 202160251694906929, 3876276632392216321, 74329842782534694397, 1425379360351558502261

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

OFFSET

1,1

COMMENTS

Column 2 of A251531

LINKS

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

EXAMPLE

Some solutions for n=1

..2..0..0..2....0..2..0..0....2..1..0..1....2..1..0..0....1..0..0..0

..2..0..0..1....2..1..0..0....0..1..0..0....0..1..2..0....2..0..1..0

..1..0..0..1....2..0..2..0....0..2..0..1....0..0..1..1....0..1..2..0

CROSSREFS

Sequence in context: A233731 A187376 A187373 * A226528 A278271 A332315

Adjacent sequences: A251524 A251525 A251526 * A251528 A251529 A251530

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 04 2014

STATUS

approved