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 A263196 #4 Oct 11 2015 20:51:08 %S A263196 366629,12652497,398648507,11542428929,333834894509,9669206035811, %T A263196 281744631338581,8168432979144243,236803228434060000, %U A263196 6872338129370139753,199369625571670867675,5782741479669647970363,167698271515683910798963 %N A263196 Number of (n+3)X(2+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 A263196 Column 2 of A263198. %H A263196 R. H. Hardin, <a href="/A263196/b263196.txt">Table of n, a(n) for n = 1..70</a> %e A263196 Some solutions for n=1 %e A263196 ..0..0..1..1..1....1..0..1..0..1....1..0..0..0..0....0..1..0..0..0 %e A263196 ..1..1..0..0..1....0..1..1..1..0....0..1..1..0..0....1..0..1..1..0 %e A263196 ..0..1..0..1..1....0..0..0..1..1....0..0..0..1..1....0..0..1..1..0 %e A263196 ..1..0..0..0..0....0..0..0..1..0....0..1..1..1..1....1..1..0..0..1 %Y A263196 Cf. A263198. %K A263196 nonn %O A263196 1,1 %A A263196 _R. H. Hardin_, Oct 11 2015