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 A228758 #7 Sep 03 2013 23:53:19 %S A228758 32,144,3111,29608,418370,4823826,61534448,746135864,9275632316, %T A228758 113914525214,1407229306722,17335288371612,213833281859269, %U A228758 2636011878793640,32504748521697000,400762354405626468 %N A228758 Number of 6Xn binary arrays with top left element equal to 1 and no two ones adjacent horizontally or antidiagonally. %C A228758 Row 6 of A228754 %H A228758 R. H. Hardin, <a href="/A228758/b228758.txt">Table of n, a(n) for n = 1..210</a> %F A228758 Empirical: a(n) = a(n-1) +119*a(n-2) +397*a(n-3) -1395*a(n-4) -5213*a(n-5) +8797*a(n-6) +24443*a(n-7) -36756*a(n-8) -45888*a(n-9) +84092*a(n-10) +19388*a(n-11) -83412*a(n-12) +24912*a(n-13) +22741*a(n-14) -12257*a(n-15) -1459*a(n-16) +1607*a(n-17) -49*a(n-18) -71*a(n-19) +3*a(n-20) +a(n-21) %e A228758 Some solutions for n=4 %e A228758 ..1..0..0..1....1..0..0..0....1..0..0..0....1..0..0..1....1..0..1..0 %e A228758 ..1..0..0..1....0..0..0..1....0..0..0..1....0..1..0..0....1..0..0..0 %e A228758 ..0..1..0..0....0..0..0..0....1..0..0..0....0..0..0..1....0..0..1..0 %e A228758 ..0..0..0..0....0..0..0..1....0..1..0..1....1..0..0..1....0..0..0..0 %e A228758 ..0..1..0..1....0..1..0..1....0..1..0..0....1..0..0..1....1..0..0..1 %e A228758 ..0..1..0..1....0..0..0..0....0..0..0..0....1..0..0..0....1..0..0..1 %K A228758 nonn %O A228758 1,1 %A A228758 _R. H. Hardin_ Sep 02 2013