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 A262920 #4 Oct 04 2015 10:16:19 %S A262920 19,61,1207,7417,152587,1550557,30497815,420921961,7895204299, %T A262920 126160746301,2313326012887,39531526974937,720265713036427, %U A262920 12724622932131997,232102910290030615,4177632885527495881 %N A262920 Number of (6+1)X(n+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 A262920 Row 6 of A262917. %H A262920 R. H. Hardin, <a href="/A262920/b262920.txt">Table of n, a(n) for n = 1..210</a> %H A262920 R. H. Hardin, <a href="/A262920/a262920.txt">Empirical recurrence of order 65</a> %F A262920 Empirical recurrence of order 65 (see link above) %e A262920 Some solutions for n=4 %e A262920 ..0..0..0..1..1....0..0..1..1..0....0..0..1..1..0....0..0..0..0..0 %e A262920 ..0..0..0..1..1....1..1..1..1..0....1..0..0..1..0....0..1..1..1..1 %e A262920 ..0..1..0..0..1....1..1..1..1..0....1..1..0..1..1....0..0..1..1..0 %e A262920 ..0..0..0..0..0....1..1..0..1..1....1..1..0..1..1....1..0..0..1..0 %e A262920 ..0..1..1..0..0....0..1..1..1..1....0..1..1..1..1....1..0..0..1..0 %e A262920 ..0..0..1..1..0....0..1..1..1..1....0..0..1..1..0....1..1..0..1..1 %e A262920 ..0..1..1..0..0....0..1..1..0..0....0..0..0..0..0....0..1..1..1..1 %Y A262920 Cf. A262917. %K A262920 nonn %O A262920 1,1 %A A262920 _R. H. Hardin_, Oct 04 2015