%I #10 Jan 01 2023 09:47:04
%S 3465,546525,463425639,1212903660581,11726484486571601
%N Number of ways to place any number of black and any number of white nonattacking knights on an (n+2) X (n+2) board.
%C Diagonal of A251531.
%e Some solutions for n=1:
%e 0 0 2 2 2 2 0 2 2 0 0 1 2 1 0 0 0 0 0 0 0
%e 0 1 1 2 2 0 2 2 1 0 0 0 0 1 0 1 2 0 0 1 0
%e 0 2 0 2 2 2 0 2 0 2 1 0 0 2 1 0 2 1 0 1 2
%K nonn,more
%O 1,1
%A _R. H. Hardin_, Dec 04 2014