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 A267666 #4 Jan 19 2016 08:07:33 %S A267666 15,450,13500,188301,2369260,25652956,264709135,2629810220, %T A267666 25695609592,248940754959,2403684195338,23214264266490, %U A267666 224513724291545,2177014307614418,21166636724769010,206403484324982865 %N A267666 Number of nX7 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 A267666 Column 7 of A267667. %H A267666 R. H. Hardin, <a href="/A267666/b267666.txt">Table of n, a(n) for n = 1..86</a> %e A267666 Some solutions for n=4 %e A267666 ..0..1..0..0..1..0..1....0..0..1..0..1..1..0....0..1..0..1..0..0..1 %e A267666 ..0..0..1..1..0..0..1....0..1..1..0..0..1..1....0..1..0..1..1..0..0 %e A267666 ..0..1..1..0..1..0..1....0..1..1..0..0..1..1....1..0..1..0..1..1..0 %e A267666 ..1..0..0..1..0..1..1....1..0..1..0..1..0..0....0..1..0..1..1..0..0 %Y A267666 Cf. A267667. %K A267666 nonn %O A267666 1,1 %A A267666 _R. H. Hardin_, Jan 19 2016