%I #4 Jul 17 2018 12:30:31
%S 8,128,1498,16976,194917,2232443,25592081,293396247,3363774685,
%T 38567002402,442190165511,5069971897424,58130384281161,
%U 666502012404350,7641876562145390,87619083075260591,1004609897507110225
%N Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.
%C Column 4 of A316960.
%H R. H. Hardin, <a href="/A316956/b316956.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n-1) +37*a(n-2) -150*a(n-3) -869*a(n-4) -848*a(n-5) +778*a(n-6) +2809*a(n-7) +2206*a(n-8) -482*a(n-9) -2290*a(n-10) -1416*a(n-11) -190*a(n-12) +42*a(n-13) -23*a(n-14) +23*a(n-15) +46*a(n-16) for n>17
%e Some solutions for n=5
%e ..0..0..0..1. .0..0..1..0. .0..0..0..0. .0..0..0..0. .0..0..1..0
%e ..1..0..1..1. .0..1..0..1. .1..1..0..1. .1..0..0..0. .1..1..1..1
%e ..0..1..0..0. .1..1..1..0. .0..1..1..0. .0..1..1..1. .0..0..0..0
%e ..1..1..0..1. .1..1..0..1. .1..0..0..0. .0..0..1..1. .0..0..1..0
%e ..1..1..0..1. .0..0..1..0. .1..0..1..1. .0..1..1..0. .1..0..0..0
%Y Cf. A316960.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jul 17 2018
|