Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Feb 13 2016 08:25:56
%S 96,248,1524,10340,64112,387146,2258084,12951796,73011192,406925194,
%T 2244513800,12281806624,66734787464,360505595710,1937557458852,
%U 10367717536488,55261185262316,293537189567482,1554428843176696
%N Number of nX5 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.
%C Column 5 of A268774.
%H R. H. Hardin, <a href="/A268771/b268771.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-1) +28*a(n-2) -62*a(n-3) -314*a(n-4) +78*a(n-5) +867*a(n-6) +6*a(n-7) -859*a(n-8) +46*a(n-9) +215*a(n-10) -8*a(n-11) -16*a(n-12) for n>14
%e Some solutions for n=4
%e ..1..2..1..2..2. .2..1..2..1..2. .0..0..1..1..0. .2..2..1..2..1
%e ..2..2..2..2..2. .2..1..2..2..2. .0..0..0..0..0. .2..2..2..2..2
%e ..1..2..2..2..1. .2..2..2..2..2. .0..1..0..1..0. .2..1..2..2..2
%e ..2..2..2..2..1. .2..2..2..2..1. .0..0..0..0..0. .2..2..1..2..1
%Y Cf. A268774.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 13 2016