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 A267671 #4 Jan 19 2016 08:12:10 %S A267671 20,800,6654,98438,528980,5663798,25652956,245171384,1013801118, %T A267671 9371493930,36493683322,338859534762,1258923096090,11981816150524, %U A267671 42692770908886,421365884931922,1442510986422868,14867064750007770 %N A267671 Number of 6Xn 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 A267671 Row 6 of A267667. %H A267671 R. H. Hardin, <a href="/A267671/b267671.txt">Table of n, a(n) for n = 1..140</a> %e A267671 Some solutions for n=4 %e A267671 ..0..1..0..0....0..0..1..0....0..1..1..0....0..1..0..1....0..1..1..0 %e A267671 ..1..1..0..0....1..0..0..1....0..1..1..0....1..1..0..1....0..1..0..1 %e A267671 ..1..0..1..0....0..0..1..1....1..1..0..1....0..1..0..0....0..1..1..0 %e A267671 ..0..1..0..0....1..0..1..1....0..0..1..0....1..1..0..1....0..1..0..1 %e A267671 ..1..1..0..0....1..0..1..1....0..1..1..0....1..1..0..1....1..1..0..1 %e A267671 ..0..1..1..0....1..1..0..1....1..1..0..0....0..1..0..0....0..1..1..0 %Y A267671 Cf. A267667. %K A267671 nonn %O A267671 1,1 %A A267671 _R. H. Hardin_, Jan 19 2016