This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A239991 #8 Jun 14 2014 16:24:53 %S A239991 15,208,4113,70107,1174822,16721012,226886115,2823199343,33074332722, %T A239991 366468588411,3862531765288,38827887664460,374132975836928, %U A239991 3462018008021025,30769710869286232,262533007814160639 %N A239991 Number of 7 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4. %C A239991 Row 7 of A239986. %H A239991 R. H. Hardin, <a href="/A239991/b239991.txt">Table of n, a(n) for n = 1..53</a> %e A239991 Some solutions for n=3: %e A239991 ..3..0..0....3..0..0....3..0..0....3..0..0....3..0..0....3..0..0....3..0..0 %e A239991 ..3..1..3....3..1..3....3..1..3....2..1..0....2..3..0....2..3..0....3..1..3 %e A239991 ..2..1..0....3..1..2....3..1..3....2..0..0....2..0..1....2..0..0....3..2..3 %e A239991 ..3..2..2....2..3..2....2..3..3....3..0..0....2..0..0....3..2..0....2..3..3 %e A239991 ..2..1..0....2..0..0....2..1..2....3..2..0....2..0..0....3..1..3....2..1..2 %e A239991 ..2..1..0....2..0..0....2..1..2....2..3..3....3..2..2....2..3..3....2..0..3 %e A239991 ..2..1..1....2..1..2....2..0..1....3..2..2....3..1..3....3..0..2....3..0..1 %K A239991 nonn %O A239991 1,1 %A A239991 _R. H. Hardin_, Mar 30 2014