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 A267643 #4 Jan 18 2016 20:11:48 %S A267643 15,450,2829,32303,128441,1117207,3696933,30649693,90914453,784186403, %T A267643 2141552549,19980003873,50876741513,520249434779,1246972578665, %U A267643 13942225071453,31756214522413,383944691019691,839150694697605 %N A267643 Number of nX7 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order. %C A267643 Column 7 of A267644. %H A267643 R. H. Hardin, <a href="/A267643/b267643.txt">Table of n, a(n) for n = 1..96</a> %e A267643 Some solutions for n=5 %e A267643 ..0..0..1..1..0..0..1....0..1..1..0..1..0..1....0..1..0..1..0..1..1 %e A267643 ..1..1..0..0..1..0..1....1..0..0..1..0..1..0....1..0..1..0..1..0..1 %e A267643 ..0..0..1..1..0..1..0....0..0..1..0..1..0..1....0..1..0..1..1..0..0 %e A267643 ..1..0..1..0..0..1..0....1..1..0..1..0..1..0....1..0..1..0..0..1..1 %e A267643 ..1..1..0..0..1..0..1....1..1..0..0..1..0..1....1..1..0..1..0..1..0 %Y A267643 Cf. A267644. %K A267643 nonn %O A267643 1,1 %A A267643 _R. H. Hardin_, Jan 18 2016