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 A263195 #5 Oct 11 2015 20:50:26 %S A263195 22718,366629,5486039,76647286,1068732662,14937290926,209908668003, %T A263195 2937919473696,41102571427488,575909145559159,8065820852218665, %U A263195 112941785153648623,1581143563815783512,22137080151280996895 %N A263195 Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits. %C A263195 Column 1 of A263198. %H A263195 R. H. Hardin, <a href="/A263195/b263195.txt">Table of n, a(n) for n = 1..210</a> %e A263195 Some solutions for n=1 %e A263195 ..1..0..0..1....0..0..1..0....0..0..1..0....0..0..0..1....1..0..0..1 %e A263195 ..0..1..1..0....1..0..1..1....1..0..0..1....1..1..0..0....0..0..0..1 %e A263195 ..1..1..0..0....1..1..0..0....0..0..0..1....1..0..1..1....0..1..1..0 %e A263195 ..1..0..0..0....1..0..0..1....0..1..1..0....0..1..1..0....1..0..0..0 %Y A263195 Cf. A263198. %K A263195 nonn %O A263195 1,1 %A A263195 _R. H. Hardin_, Oct 11 2015