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 A267916 #4 Jan 22 2016 08:04:43 %S A267916 34,6734,754852,98614986,10441322974,1145682971200,115481667816142, %T A267916 11676922629038734,1137131204736014484,110241494900681903644, %U A267916 10496364364121629281022,994376596006517401565186 %N A267916 Number of 5Xn 0..2 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. %C A267916 Row 5 of A267911. %H A267916 R. H. Hardin, <a href="/A267916/b267916.txt">Table of n, a(n) for n = 1..31</a> %e A267916 Some solutions for n=2 %e A267916 ..0..1....0..1....0..1....0..1....0..0....0..0....0..1....0..1....0..1....0..1 %e A267916 ..0..0....0..0....1..1....1..1....0..1....1..2....0..1....0..0....1..0....0..1 %e A267916 ..1..1....1..0....1..2....1..0....0..2....2..1....1..1....2..1....2..1....0..2 %e A267916 ..0..2....2..0....1..0....0..1....2..2....0..2....2..1....0..0....0..0....0..0 %e A267916 ..1..0....1..2....2..2....1..2....0..0....2..0....0..0....2..2....0..0....2..2 %Y A267916 Cf. A267911. %K A267916 nonn %O A267916 1,1 %A A267916 _R. H. Hardin_, Jan 22 2016