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”).
%I #3 Dec 08 2012 14:19:44
%S 2,18,143,816,4467,27192,158296,915920,5443662,31825008,185788218,
%T 1094039664,6406886173,37509117127,220173740293,1290097909772,
%U 7558886967916,44324041325721
%N Equals two maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to exactly two of their king-move neighbors in a random 0..1 nX3 array
%C Column 3 of A220247
%e Some solutions for n=3
%e ..0..0..0....0..1..0....1..0..0....0..1..0....0..0..0....0..1..0....1..0..0
%e ..0..0..0....1..1..0....0..0..0....1..0..0....0..0..0....1..0..0....0..0..1
%e ..0..1..0....0..0..1....0..0..0....0..0..1....0..0..0....0..0..0....0..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 08 2012