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 A262272 #4 Sep 17 2015 08:21:32 %S A262272 52,2704,23977,467065,20331508,1002110608,41261408089,1965295140265, %T A262272 100013594816980,5157201006399760,263679548424381769, %U A262272 13615797474906740569,706318618109394294196,36687081176072230888336 %N A262272 Number of (n+2)X(6+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits. %C A262272 Column 6 of A262274. %H A262272 R. H. Hardin, <a href="/A262272/b262272.txt">Table of n, a(n) for n = 1..210</a> %e A262272 Some solutions for n=3 %e A262272 ..1..1..0..0..1..0..0..0....1..0..1..0..1..0..1..0....0..1..1..1..1..1..0..1 %e A262272 ..0..1..1..1..0..0..1..1....1..1..1..1..0..0..0..0....0..1..0..1..1..1..1..1 %e A262272 ..1..1..1..1..1..0..1..0....1..0..1..1..1..1..1..0....0..1..1..0..1..0..0..1 %e A262272 ..0..1..1..1..0..0..1..1....1..1..1..1..0..0..0..0....0..1..0..0..1..0..1..1 %e A262272 ..0..0..1..1..0..0..1..0....0..0..0..1..0..1..0..0....0..0..0..1..0..1..0..0 %Y A262272 Cf. A262274. %K A262272 nonn %O A262272 1,1 %A A262272 _R. H. Hardin_, Sep 17 2015