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 Apr 04 2014 08:45:02
%S 32,1418,55680,2044806,73440130,2607237326,92003133794,3236101836296,
%T 113624636162418,3985651854889090,139731093389917992,
%U 4897309578556430096,171612989550424151944,6013159384213632096858,210684692204081768578168
%N Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4
%C Column 5 of A240347
%H R. H. Hardin, <a href="/A240345/b240345.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..2..0..0..2....2..2..0..0..2....2..2..2..2..0....2..2..0..0..0
%e ..0..2..2..2..2....2..0..2..2..1....0..0..2..2..3....2..2..0..2..0
%e ..2..0..0..2..0....0..0..2..0..2....0..0..0..2..2....2..0..0..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Apr 04 2014