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 A267672 #4 Jan 19 2016 08:13:09 %S A267672 33,2178,23967,508681,3351233,49212395,264709135,3440837625, %T A267672 16542903583,209284190883,930275727707,11993946979651,49948696841159, %U A267672 673353248482869,2639663600329837,37779497780890237,139596586349861267 %N A267672 Number of 7Xn 0..1 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 A267672 Row 7 of A267667. %H A267672 R. H. Hardin, <a href="/A267672/b267672.txt">Table of n, a(n) for n = 1..47</a> %e A267672 Some solutions for n=3 %e A267672 ..0..0..1....0..0..1....0..1..0....0..1..0....0..1..1....0..0..1....0..0..1 %e A267672 ..0..1..1....0..0..1....1..0..1....0..1..1....1..0..1....1..0..0....1..0..0 %e A267672 ..0..1..0....0..0..1....0..0..1....1..1..0....0..1..1....0..1..0....0..0..1 %e A267672 ..1..0..1....1..1..0....0..0..1....0..0..1....1..0..0....1..0..0....1..1..0 %e A267672 ..0..1..1....0..0..1....0..1..0....0..1..1....0..1..1....0..1..0....1..0..0 %e A267672 ..0..1..0....0..0..1....0..0..1....1..1..0....1..1..0....1..0..0....1..0..0 %e A267672 ..0..1..1....0..1..0....1..0..0....0..0..1....0..1..1....0..1..1....1..0..0 %Y A267672 Cf. A267667. %K A267672 nonn %O A267672 1,1 %A A267672 _R. H. Hardin_, Jan 19 2016