%I #4 Jan 15 2017 09:29:36
%S 8,504,3460,5368,9484,17592,33199,63976,124361,236858,440416,804942,
%T 1465281,2671158,4870336,8846774,15982707,28727890,51478434,92068606,
%U 164424023,293099566,521431738,925749102,1640794125,2903847314
%N Number of nX5 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C Column 5 of A281139.
%H R. H. Hardin, <a href="/A281136/b281136.txt">Table of n, a(n) for n = 1..250</a>
%F Empirical: a(n) = 2*a(n-1) +a(n-2) -4*a(n-3) +5*a(n-4) -4*a(n-5) +5*a(n-6) -4*a(n-7) -14*a(n-8) +12*a(n-9) -13*a(n-10) +14*a(n-11) -24*a(n-12) +20*a(n-13) +9*a(n-14) +8*a(n-15) +7*a(n-16) -10*a(n-17) +20*a(n-18) -6*a(n-19) -6*a(n-20) -12*a(n-21) -9*a(n-24) for n>33
%e Some solutions for n=4
%e ..0..1..1..2..0. .0..1..0..1..1. .0..0..1..2..0. .0..1..2..1..2
%e ..0..2..0..0..1. .2..2..0..2..2. .1..2..1..2..1. .2..0..0..1..0
%e ..1..2..1..2..1. .0..1..0..1..0. .0..2..0..2..0. .1..1..2..2..0
%e ..1..0..0..2..0. .2..1..2..1..0. .0..1..0..1..0. .2..0..0..1..1
%Y Cf. A281139.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 15 2017