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 A267665 #4 Jan 19 2016 08:06:50 %S A267665 11,242,5324,60401,624476,5663798,49212395,413258400,3417993766, %T A267665 28026084373,228941114008,1868432655976,15254571685815, %U A267665 124714040038344,1021298776008550,8379613096399389,68885791116415104,567383480583996940 %N A267665 Number of nX6 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 A267665 Column 6 of A267667. %H A267665 R. H. Hardin, <a href="/A267665/b267665.txt">Table of n, a(n) for n = 1..209</a> %e A267665 Some solutions for n=4 %e A267665 ..0..1..0..1..1..0....0..0..1..0..1..0....0..1..1..0..0..1....0..1..1..0..1..0 %e A267665 ..1..0..1..0..1..0....1..1..0..1..0..0....0..0..1..1..0..0....1..1..0..1..0..1 %e A267665 ..1..0..1..0..1..0....1..0..0..1..0..1....1..1..0..1..0..1....0..1..0..1..1..0 %e A267665 ..1..1..0..1..0..1....1..0..1..1..0..0....0..1..1..0..0..1....1..1..0..0..1..0 %Y A267665 Cf. A267667. %K A267665 nonn %O A267665 1,1 %A A267665 _R. H. Hardin_, Jan 19 2016