|
%I #6 Mar 25 2022 18:52:20
%S 31361437,4060878845,629694824303,85453027245665,11726484486571601,
%T 1671396405843418205,239415740786170785059,34268623489221568471683,
%U 4926792732223129880488261,710174571545415147604020125
%N Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (5+2) board.
%C Column 5 of A251531.
%H R. H. Hardin, <a href="/A251530/b251530.txt">Table of n, a(n) for n = 1..11</a>
%e Some solutions for n=1
%e ..0..0..0..1..1..0..0....0..0..0..0..0..0..2....0..0..0..0..0..0..2
%e ..0..0..0..0..0..0..1....0..0..0..2..2..2..1....0..0..0..1..0..0..2
%e ..0..0..0..0..1..0..0....0..0..0..2..1..0..0....0..0..2..2..2..0..0
%Y Cf. A251531.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 04 2014
| 