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 #4 Dec 24 2012 17:36:16
%S 1,38,379,3687,30963,253013,2042071,16390010,131304057,1051088784,
%T 8410953281,67295527293,538391560268,4307227357177,34458145224515,
%U 275666265873864,2205333684261561,17642679462717579,141141451046332037
%N Equals one maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 3Xn array
%C Row 3 of A220916
%H R. H. Hardin, <a href="/A220918/b220918.txt">Table of n, a(n) for n = 1..33</a>
%e Some solutions for n=3
%e ..0..0..0....0..1..1....1..0..1....0..1..1....0..0..1....0..1..0....1..0..0
%e ..1..0..0....1..1..1....0..0..1....1..0..1....0..1..1....0..0..0....1..0..0
%e ..0..1..0....1..0..0....0..1..1....0..0..1....1..0..1....1..1..1....1..1..0
%K nonn
%O 1,2
%A _R. H. Hardin_ Dec 24 2012