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 A267964 #4 Jan 22 2016 14:29:56 %S A267964 159,25281,2253828,185900905,12628574785,788980366553,44750006935212, %T A267964 2380009487628460,119102221790408950,5679107254350714417, %U A267964 259271407469847625873,11405005155091115435008,485271704403173804854458 %N A267964 Number of nX5 0..2 arrays with every repeated value in every row and column greater than the previous repeated value. %C A267964 Column 5 of A267966. %H A267964 R. H. Hardin, <a href="/A267964/b267964.txt">Table of n, a(n) for n = 1..38</a> %e A267964 Some solutions for n=2 %e A267964 ..0..1..0..1..0....1..0..2..1..1....0..1..2..1..1....2..0..2..1..2 %e A267964 ..1..0..2..1..0....1..0..0..1..2....1..2..1..0..1....2..2..1..0..2 %Y A267964 Cf. A267966. %K A267964 nonn %O A267964 1,1 %A A267964 _R. H. Hardin_, Jan 22 2016