|
%I #4 Feb 02 2018 07:37:45
%S 8,121,927,8245,74329,664377,5966905,53667656,482603686,4340430649,
%T 39040203717,351150199077,3158465607310,28409347903144,
%U 255532834427292,2298435315054163,20673687740237324,185953195378108520
%N Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.
%C Column 4 of A299081.
%H R. H. Hardin, <a href="/A299077/b299077.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 9*a(n-1) +37*a(n-3) -292*a(n-4) -375*a(n-5) -491*a(n-6) +1814*a(n-7) +3581*a(n-8) +3193*a(n-9) -3202*a(n-10) -11261*a(n-11) -6211*a(n-12) -1851*a(n-13) +14158*a(n-14) -1752*a(n-15) +10727*a(n-16) -10489*a(n-17) +10142*a(n-18) -13135*a(n-19) +8571*a(n-20) -4435*a(n-21) +6805*a(n-22) -3831*a(n-23) +947*a(n-24) -578*a(n-25) +842*a(n-26) -308*a(n-27) +40*a(n-28) -154*a(n-29) +40*a(n-30) for n>31
%e Some solutions for n=5
%e ..0..0..0..0. .0..1..0..1. .0..1..0..1. .0..1..0..1. .0..1..0..1
%e ..1..0..0..1. .0..1..1..1. .0..1..1..1. .0..0..0..0. .1..0..1..0
%e ..0..0..0..0. .0..1..1..1. .0..1..1..1. .1..1..1..1. .1..0..0..0
%e ..0..0..0..0. .0..1..0..1. .0..1..0..1. .0..1..1..0. .1..0..0..0
%e ..1..0..0..1. .0..0..1..1. .1..0..0..1. .1..1..1..1. .1..0..1..0
%Y Cf. A299081.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 02 2018
| 