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 #6 Apr 23 2021 11:33:18
%S 1,77,1653,12601,639327,26724927,702794334,24416753991,892243428330,
%T 29462787050221,998361846643570,34570695463676885,1178226645017158477,
%U 40142564452672581992,1374478845809683086730,46978226057419131275321
%N Number of n X 7 0..1 arrays with each 1 adjacent to 3, 4 or 5 king-move neighboring 1's.
%C Column 7 of A296990.
%H R. H. Hardin, <a href="/A296989/b296989.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..0..0..0..0..0..1..1. .0..0..0..1..1..0..0. .0..0..0..0..0..1..1
%e ..0..0..0..0..0..1..1. .0..1..1..0..1..1..0. .0..0..1..0..0..1..1
%e ..0..1..1..0..1..0..1. .0..1..1..0..1..1..1. .1..1..1..1..0..1..1
%e ..0..1..1..1..1..1..0. .0..0..1..1..0..1..0. .1..1..0..1..1..0..0
%Y Cf. A296990.
%K nonn
%O 1,2
%A _R. H. Hardin_, Dec 22 2017