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

%I #4 Dec 04 2014 12:00:02

%S 3465,30377,318659,3222565,31361437,307927905,3055869419,30236761389,

%T 298577465957,2950327719065,29170975532007,288360297088757,

%U 2850205052528725,28173293046232005,278493129973163419

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

%C Column 1 of A251531

%H R. H. Hardin, <a href="/A251526/b251526.txt">Table of n, a(n) for n = 1..210</a>

%H R. H. Hardin, <a href="/A251526/a251526.txt">Empirical recurrence of order 57</a>

%F Empirical recurrence of order 57 (see link above)

%e Some solutions for n=2

%e ..0..0..2....2..1..2....1..0..0....2..2..2....2..2..0....2..0..0....0..1..1

%e ..2..2..0....2..0..0....2..2..1....0..0..2....2..1..0....0..0..2....0..1..0

%e ..0..0..2....0..2..0....1..0..2....2..2..0....0..2..0....0..0..0....0..0..0

%e ..0..0..2....0..2..2....2..0..0....1..0..0....0..2..1....1..2..2....0..0..1

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 04 2014