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 A267978 #4 Jan 23 2016 10:04:55 %S A267978 222,49284,10941048,2208460532,422888259007,77239556027716, %T A267978 13568675256814069,2305686585583566677,380719989364128125411, %U A267978 61309427889879303297626,9657019976002416918553516 %N A267978 Number of 4Xn 0..3 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. %C A267978 Row 4 of A267974. %H A267978 R. H. Hardin, <a href="/A267978/b267978.txt">Table of n, a(n) for n = 1..45</a> %e A267978 Some solutions for n=2 %e A267978 ..2..2....3..2....1..0....2..3....0..1....3..0....3..2....3..0....2..2....0..0 %e A267978 ..3..2....1..2....3..0....2..0....3..1....2..2....2..3....1..0....1..3....1..0 %e A267978 ..3..1....1..3....1..1....1..0....2..2....1..1....2..0....0..1....0..2....2..1 %e A267978 ..2..0....3..2....1..1....2..2....0..0....0..2....3..2....0..1....2..1....0..2 %Y A267978 Cf. A267974. %K A267978 nonn %O A267978 1,1 %A A267978 _R. H. Hardin_, Jan 23 2016