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 21 2012 06:18:49
%S 1,23,142,1753,15486,132977,1115041,9161834,74617693,602687874,
%T 4850347565,38924669434
%N Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 3Xn array
%C Row 3 of A220794
%e Some solutions for n=3
%e ..0..1..0....1..1..0....0..0..1....0..0..0....1..1..1....0..0..0....0..1..0
%e ..1..1..0....0..0..1....0..0..0....0..0..1....0..0..0....0..1..0....0..0..0
%e ..0..1..1....0..0..0....1..0..0....1..0..1....0..0..1....0..0..1....1..1..1
%K nonn
%O 1,2
%A _R. H. Hardin_ Dec 21 2012