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 Mar 06 2017 17:05:55
%S 0,91,4420,116624,2993934,71707838,1644385909,36631580212,
%T 797807876394,17071093013959,360093050350939,7506214481935722,
%U 154911588816764077,3169754325029230295,64378159448861378436,1299032728948862185980
%N Number of nX5 0..1 arrays with no 1 equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements.
%C Column 5 of A283386.
%H R. H. Hardin, <a href="/A283383/b283383.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..0..0..1..1..1. .0..0..0..0..0. .1..0..1..0..1. .0..0..1..0..0
%e ..1..0..0..1..0. .1..0..1..0..1. .0..0..1..0..1. .1..0..1..1..1
%e ..0..0..0..1..0. .0..0..1..1..1. .0..1..0..1..0. .0..0..0..1..0
%e ..0..1..0..1..0. .0..0..1..0..0. .1..0..1..1..1. .1..1..1..0..1
%Y Cf. A283386.
%K nonn
%O 1,2
%A _R. H. Hardin_, Mar 06 2017