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 A262913 #4 Oct 04 2015 10:11:30 %S A262913 1,11,33,137,1411,7417,51769,529931,4701201,44632313,454922851, %T A262913 4573641865,46374477961,476430252011,4902011719233,50649718388009, %U A262913 526357874613571,5483464232074777,57393678601087705,603752064813378251 %N A262913 Number of (n+1)X(4+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits. %C A262913 Column 4 of A262917. %H A262913 R. H. Hardin, <a href="/A262913/b262913.txt">Table of n, a(n) for n = 1..210</a> %e A262913 Some solutions for n=4 %e A262913 ..0..0..1..1..0....1..1..1..1..0....1..1..0..0..0....0..1..1..0..0 %e A262913 ..0..0..1..1..0....1..1..1..1..0....1..1..1..1..0....0..0..1..1..0 %e A262913 ..1..1..1..1..0....1..1..1..1..0....1..1..1..1..0....1..1..1..1..0 %e A262913 ..1..1..0..0..0....0..0..0..0..0....0..0..1..1..0....1..0..0..1..0 %e A262913 ..1..1..0..0..0....0..0..0..0..0....0..0..0..0..0....1..1..0..0..0 %Y A262913 Cf. A262917. %K A262913 nonn %O A262913 1,2 %A A262913 _R. H. Hardin_, Oct 04 2015