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 10 2015 07:55:12
%S 3,79,9327,927797,82725668,12404184853,1961916558139,205199911524811,
%T 32566506281706134,3625304390972323537,618755342504397622109,
%U 87849263845468588422281,14938881681298157851105131
%N Number of 3Xn 0..3*n-1 arrays with upper left zero and lower right 3*n-1 and each element differing from its horizontal and antidiagonal neighbors by a power of two.
%C Row 3 of A265590.
%H R. H. Hardin, <a href="/A265592/b265592.txt">Table of n, a(n) for n = 1..112</a>
%e Some solutions for n=3
%e ..0..8..0....0..4..6....0..8..0....0..4..0....0..4..5....0..1..0....0..4..5
%e ..0..1..5....6..4..8....0..4..5....3..2..3....5..4..3....5..1..3....6..7..8
%e ..2..6..8....8..6..8....5..6..8....6..7..8....3..4..8....0..4..8....5..4..8
%Y Cf. A265590.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 10 2015