The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Aug 12 2016 06:54:01
%S 1,2,5,15,61,350,2437,18530,145263,1156222,9288411,75111303,610606621,
%T 4987797081,40929379643,337321631621,2791500307920,23190727949125,
%U 193361664061657,1617714495430036,13577128985320094,114285836177458835
%N Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any north or northeast neighbors modulo 4 and the upper left element equal to 0.
%C Row 4 of A267553.
%H R. H. Hardin, <a href="/A267558/b267558.txt">Table of n, a(n) for n = 1..32</a>
%e Some solutions for n=4
%e ..0..1..1..1....0..0..1..1....0..1..2..2....0..0..1..1....0..0..0..1
%e ..1..2..2..2....1..1..2..2....1..2..3..3....0..1..2..2....0..1..1..2
%e ..2..3..3..3....2..2..3..3....2..3..0..0....1..2..3..3....1..2..2..3
%e ..3..0..0..0....3..3..0..0....3..0..1..1....2..3..0..3....2..3..3..3
%Y Cf. A267553.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 17 2016