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 A269085 #4 Feb 19 2016 09:20:56 %S A269085 13,76,428,2238,11314,55620,268289,1274435,5982734,27813229,128268964, %T A269085 587560638,2675945006,12126527636,54715085702,245932380152, %U A269085 1101667424213,4920048498594,21913218006880,97358802936939,431593734805059 %N A269085 Number of nX4 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once. %C A269085 Column 4 of A269089. %H A269085 R. H. Hardin, <a href="/A269085/b269085.txt">Table of n, a(n) for n = 1..210</a> %F A269085 Empirical: a(n) = 2*a(n-1) +19*a(n-2) +10*a(n-3) -122*a(n-4) -320*a(n-5) -295*a(n-6) +8*a(n-7) +176*a(n-8) +20*a(n-9) -98*a(n-10) -6*a(n-11) +43*a(n-12) -6*a(n-13) -11*a(n-14) +6*a(n-15) -a(n-16) %e A269085 Some solutions for n=4 %e A269085 ..1..0..0..1. .1..1..0..0. .0..0..0..0. .0..0..1..0. .1..0..0..0 %e A269085 ..1..0..0..0. .0..0..0..1. .1..0..1..0. .0..0..0..1. .0..0..1..0 %e A269085 ..0..1..0..1. .0..0..0..0. .1..0..0..0. .0..0..1..0. .0..0..0..1 %e A269085 ..0..0..0..0. .0..1..0..1. .0..1..0..0. .1..0..0..0. .0..0..0..0 %Y A269085 Cf. A269089. %K A269085 nonn %O A269085 1,1 %A A269085 _R. H. Hardin_, Feb 19 2016