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 A269073 #4 Feb 19 2016 08:42:51 %S A269073 41,489,7477,102545,1383105,18220241,236272677,3024972401,38333973609, %T A269073 481701017577,6010309951205,74542025956769,919716929870465, %U A269073 11296618314880209,138204770920790229,1684906034464128193 %N A269073 Number of nX6 binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once. %C A269073 Column 6 of A269075. %H A269073 R. H. Hardin, <a href="/A269073/b269073.txt">Table of n, a(n) for n = 1..210</a> %F A269073 Empirical: a(n) = 28*a(n-1) -230*a(n-2) +192*a(n-3) +3805*a(n-4) -5776*a(n-5) -27808*a(n-6) +25744*a(n-7) +101333*a(n-8) -13916*a(n-9) -149690*a(n-10) -66848*a(n-11) +23183*a(n-12) +9888*a(n-13) -2304*a(n-14) %e A269073 Some solutions for n=4 %e A269073 ..1..0..0..0..0..0. .0..0..1..0..0..1. .1..0..0..0..0..1. .0..0..1..0..1..0 %e A269073 ..0..0..0..0..1..0. .1..0..0..1..0..0. .0..0..0..0..0..0. .1..0..1..0..0..0 %e A269073 ..0..0..1..0..1..0. .1..0..0..0..0..0. .0..0..1..0..0..1. .0..0..0..0..1..0 %e A269073 ..1..0..0..0..0..0. .0..0..0..0..0..0. .0..0..0..0..0..1. .1..0..0..0..0..1 %Y A269073 Cf. A269075. %K A269073 nonn %O A269073 1,1 %A A269073 _R. H. Hardin_, Feb 19 2016