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 22 2017 11:22:14
%S 13,544,34464,1172252,33527252,957808843,25269280218,643705916373,
%T 16010099108460,388020733786517,9247437037805448,217036671914282451,
%U 5029023759579668243,115284880924811399314,2617941571002141930815
%N Number of nX7 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly two elements.
%C Column 7 of A282838.
%H R. H. Hardin, <a href="/A282837/b282837.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..1..0..0..0..0..1. .1..0..0..1..0..0..0. .0..0..1..0..1..0..0
%e ..0..0..1..0..0..0..1. .1..0..1..0..0..0..0. .0..0..0..1..0..0..0
%e ..1..0..0..1..0..0..1. .0..0..0..1..1..0..1. .0..0..1..0..1..1..0
%Y Cf. A282838.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 22 2017