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 A263055 #4 Oct 08 2015 14:58:31 %S A263055 10,142,1666,18390,188370,1941702,19499266,196698070,1968558130, %T A263055 19732383462,197355588066,1974792933750,19748600169490, %U A263055 197518001324422,1975194815632066,19752765325169430,197527991815422450 %N A263055 Number of (n+1)X(3+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits. %C A263055 Column 3 of A263060. %H A263055 R. H. Hardin, <a href="/A263055/b263055.txt">Table of n, a(n) for n = 1..210</a> %F A263055 Empirical: a(n) = 11*a(n-1) +35*a(n-2) -495*a(n-3) -114*a(n-4) +6204*a(n-5) -4040*a(n-6) -17600*a(n-7) +16000*a(n-8) %e A263055 Some solutions for n=4 %e A263055 ..1..0..1..0....1..1..1..0....1..1..0..1....1..1..0..1....1..0..1..1 %e A263055 ..1..1..0..1....0..1..1..1....0..0..1..0....0..0..0..1....0..1..0..1 %e A263055 ..1..0..1..0....0..1..1..1....0..0..0..1....1..0..1..1....0..0..1..0 %e A263055 ..0..0..1..0....0..0..0..1....1..0..1..0....1..0..0..0....1..1..0..1 %e A263055 ..1..0..0..0....1..0..1..0....1..0..0..0....1..0..1..1....1..0..0..0 %Y A263055 Cf. A263060. %K A263055 nonn %O A263055 1,1 %A A263055 _R. H. Hardin_, Oct 08 2015