|
%I #4 Dec 29 2017 07:40:00
%S 128,10294,780273,60872732,4729833008,367528649755,28559447121714,
%T 2219244393481926,172449018928417757,13400356819623734033,
%U 1041290690882640656766,80914733888580574615644
%N Number of nX7 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0, 1 or 2 neighboring 1s.
%C Column 7 of A297374.
%H R. H. Hardin, <a href="/A297373/b297373.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 81*a(n-1) -240*a(n-2) -231*a(n-3) -86873*a(n-4) +674621*a(n-5) -1076398*a(n-6) +7382232*a(n-7) -74914323*a(n-8) +196187727*a(n-9) -218149875*a(n-10) +418802406*a(n-11) -177800916*a(n-12) -624771071*a(n-13) +1082537773*a(n-14) -271686582*a(n-15) -453590777*a(n-16) +39081217*a(n-17) +50792257*a(n-18) +80197691*a(n-19) +5431103*a(n-20) -17470712*a(n-21) -2919167*a(n-22) +279200*a(n-23) +505687*a(n-24) +36189*a(n-25) -23162*a(n-26) -400*a(n-27) +240*a(n-28) for n>31
%e Some solutions for n=5
%e ..0..0..0..0..1..0..1. .0..0..0..0..1..0..0. .0..0..0..0..0..1..0
%e ..0..0..0..1..0..0..1. .0..0..0..0..0..1..0. .0..0..0..1..0..1..1
%e ..0..0..0..0..0..0..0. .0..0..0..0..1..1..0. .0..0..0..0..0..1..0
%e ..0..0..0..0..1..0..1. .0..0..0..0..1..1..0. .0..0..0..0..0..1..1
%e ..0..0..0..1..0..1..1. .0..0..0..0..0..0..1. .0..0..0..0..1..1..0
%Y Cf. A297374.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 29 2017
| 