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 A262851 #4 Oct 03 2015 16:12:56 %S A262851 13,34,196,3181,31050,352880,4679725,58693450,749598500,9769811821, %T A262851 126477115922,1640601801744,21334300812253,277222463778754, %U A262851 3602979823609668,46840315814579821,608897998235183514 %N A262851 Number of (2+2)X(n+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits. %C A262851 Row 2 of A262849. %H A262851 R. H. Hardin, <a href="/A262851/b262851.txt">Table of n, a(n) for n = 1..210</a> %e A262851 Some solutions for n=4 %e A262851 ..1..1..1..1..1..1....1..1..1..1..1..1....0..1..1..1..0..0....0..1..1..1..0..0 %e A262851 ..1..0..1..0..1..0....0..1..0..1..0..1....0..0..0..1..1..1....0..0..0..0..0..0 %e A262851 ..1..0..1..0..1..0....0..0..0..1..1..1....1..1..0..0..0..1....1..1..0..0..0..1 %e A262851 ..1..0..1..0..1..0....0..1..0..1..0..1....0..1..1..1..0..0....1..1..1..1..1..1 %Y A262851 Cf. A262849. %K A262851 nonn %O A262851 1,1 %A A262851 _R. H. Hardin_, Oct 03 2015