|
%I #5 Aug 12 2016 07:04:22
%S 1,0,3,35,889,52759,4249084,454920734,62723579604,10837409167674,
%T 2294655530073038
%N Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its west, northeast or southeast neighbor modulo n and the upper left element equal to 0.
%C Column 2 of A267222.
%e Some solutions for n=4
%e ..0..3....0..3....0..2....0..3....0..3....0..0....0..2....0..3....0..3....0..3
%e ..2..1....2..2....1..0....2..0....3..1....2..2....2..1....2..1....1..1....2..2
%e ..1..0....1..0....3..2....3..2....1..0....1..3....3..3....0..3....0..3....0..3
%e ..3..2....3..1....1..3....1..1....2..2....3..1....1..0....2..1....2..2....1..1
%Y Cf. A267222.
%K nonn
%O 1,3
%A _R. H. Hardin_, Jan 12 2016
| 