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 A262470 #4 Sep 23 2015 18:50:50 %S A262470 1,43,1849,16081,234421,8080915,326748241,10190636521,367750753321, %T A262470 14893989614299,614943639587257,25082322234133297,1040046474998577205, %U A262470 43832347852302709171,1854080585134116272977,78605030988741667500553 %N A262470 Number of (n+1)X(6+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 A262470 Column 6 of A262472. %H A262470 R. H. Hardin, <a href="/A262470/b262470.txt">Table of n, a(n) for n = 1..210</a> %e A262470 Some solutions for n=4 %e A262470 ..0..0..1..0..1..0..1....1..1..1..1..0..0..0....1..0..1..0..1..1..1 %e A262470 ..1..0..0..0..1..0..1....1..0..1..1..1..0..1....1..1..1..1..1..1..0 %e A262470 ..0..0..1..0..1..0..1....0..1..1..0..0..0..0....0..0..1..0..1..0..1 %e A262470 ..1..0..0..0..1..0..1....0..0..1..0..1..0..1....0..1..1..1..1..0..0 %e A262470 ..0..0..0..0..0..0..0....1..0..0..1..0..0..0....1..0..0..0..0..1..0 %Y A262470 Cf. A262472. %K A262470 nonn %O A262470 1,2 %A A262470 _R. H. Hardin_, Sep 23 2015