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 Jan 24 2017 08:37:15
%S 0,0,5,18,141,602,2180,7006,20979,59698,163635,435900,1135036,2901852,
%T 7307093,18167506,44683929,108886702,263208036,631773802,1507041943,
%U 3575151970,8439694735,19835439712,46433224508,108305733064,251797970649
%N Number of 2Xn 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.
%C Row 2 of A281563.
%H R. H. Hardin, <a href="/A281564/b281564.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 7*a(n-1) -10*a(n-2) -29*a(n-3) +68*a(n-4) +67*a(n-5) -195*a(n-6) -108*a(n-7) +306*a(n-8) +132*a(n-9) -276*a(n-10) -96*a(n-11) +136*a(n-12) +32*a(n-13) -32*a(n-14) for n>15
%e Some solutions for n=4
%e ..0..1..0..0. .0..0..0..1. .0..1..1..0. .0..1..1..0. .0..1..1..0
%e ..0..0..1..0. .0..1..1..1. .1..1..1..0. .0..1..1..1. .0..0..0..0
%Y Cf. A281563.
%K nonn
%O 1,3
%A _R. H. Hardin_, Jan 24 2017