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 Dec 18 2017 11:12:34
%S 34,1785,25144,775010,28341757,794602323,25499216805,833656369935,
%T 26222808591554,840734174874622,27005770482845605,862854584300141857,
%U 27641731509678179571,885667583481320105269,28356980820482071479301
%N Number of nX7 0..1 arrays with each 1 adjacent to 0, 2 or 3 king-move neighboring 1s.
%C Column 7 of A296674.
%H R. H. Hardin, <a href="/A296673/b296673.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..0..0..1..0..0..1. .0..1..0..1..1..0..0. .0..1..0..0..1..1..0
%e ..0..1..1..0..1..0..0. .1..1..0..1..0..1..0. .1..1..0..1..1..0..0
%e ..0..1..0..0..1..1..0. .0..0..1..0..0..1..1. .0..1..0..0..0..0..1
%Y Cf. A296674.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 18 2017