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 A262477 #4 Sep 23 2015 18:56:28 %S A262477 52,321,15732,239281,11489332,326748241,15659602612,630055962801, %T A262477 30747458524212,1434032788185361,71428214742445492, %U A262477 3530662718745118321,178630052786322359092,9048815928661992297681,462641624539547827848372 %N A262477 Number of (7+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits. %C A262477 Row 7 of A262472. %H A262477 R. H. Hardin, <a href="/A262477/b262477.txt">Table of n, a(n) for n = 1..102</a> %e A262477 Some solutions for n=3 %e A262477 ..1..0..0..1....0..1..1..0....0..1..1..0....1..1..0..0....0..0..1..1 %e A262477 ..1..1..0..0....1..0..0..1....0..1..1..0....0..0..1..1....0..1..1..0 %e A262477 ..1..1..0..0....1..1..1..1....0..0..1..1....0..1..1..0....0..0..1..1 %e A262477 ..1..1..0..0....1..0..0..1....0..0..1..1....0..1..1..0....0..1..1..0 %e A262477 ..1..1..0..0....0..0..0..0....1..1..0..0....0..0..1..1....0..1..1..0 %e A262477 ..1..1..0..0....0..0..0..0....1..1..0..0....0..1..1..0....0..1..1..0 %e A262477 ..1..0..0..1....1..0..0..1....1..0..0..1....1..0..0..1....0..1..1..0 %e A262477 ..1..1..0..0....1..0..0..1....1..1..0..0....0..0..1..1....0..1..1..0 %Y A262477 Cf. A262472. %K A262477 nonn %O A262477 1,1 %A A262477 _R. H. Hardin_, Sep 23 2015