The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #5 Aug 12 2016 06:54:00
%S 120,2,3,317,6240,69265,663855,12954512,466131976,13687472182,
%T 278976573772
%N Number of 6Xn arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 6 and the upper left element equal to 0.
%C Row 6 of A267278.
%e Some solutions for n=4
%e ..0..2..1..4....0..3..2..4....0..4..1..5....0..3..2..5....0..4..1..5
%e ..2..0..3..2....3..1..4..3....3..1..4..2....2..1..4..2....4..1..5..2
%e ..5..3..1..4....0..4..2..5....0..3..1..5....0..3..1..4....0..4..2..0
%e ..3..0..4..2....4..1..5..3....3..0..4..2....3..0..4..1....3..1..5..3
%e ..5..4..1..5....1..5..2..0....5..3..1..5....5..4..1..5....1..4..2..0
%e ..3..0..5..1....5..1..0..2....2..0..4..2....3..0..5..2....3..2..5..3
%Y Cf. A267278.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 12 2016