Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Feb 18 2016 11:36:19
%S 144,1068,13140,149358,1643376,17696520,187575858,1964080920,
%T 20365312416,209472681102,2140087086852,21738862087680,
%U 219728193571542,2211332610944712,22170082238167692,221519854346189046
%N Number of nX5 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.
%C Column 5 of A269052.
%H R. H. Hardin, <a href="/A269049/b269049.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 28*a(n-1) -286*a(n-2) +1290*a(n-3) -2373*a(n-4) +304*a(n-5) +3551*a(n-6) -2846*a(n-7) -546*a(n-8) +1308*a(n-9) -505*a(n-10) +76*a(n-11) -4*a(n-12) for n>13
%e Some solutions for n=4
%e ..0..1..2..2..0. .2..1..2..1..2. .0..1..2..1..2. .1..2..1..0..0
%e ..0..1..2..1..2. .2..1..2..1..2. .0..0..0..1..0. .2..2..1..0..1
%e ..0..1..0..1..0. .0..1..0..1..0. .0..0..0..1..0. .1..0..1..0..1
%e ..0..1..0..1..0. .2..0..0..0..0. .0..0..0..1..2. .1..0..1..2..1
%Y Cf. A269052.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 18 2016