login
Number of nX2 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.
1

%I #5 Jan 16 2017 08:55:05

%S 0,0,5,18,85,346,1388,5454,21171,81250,309019,1166316,4372916,

%T 16300940,60456037,223201490,820709441,3006697550,10978569420,

%U 39965443098,145083078903,525337769138,1897732902967,6840395954992,24606162295316

%N Number of nX2 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

%C Column 2 of A281165.

%H R. H. Hardin, <a href="/A281159/b281159.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 9*a(n-1) -24*a(n-2) +15*a(n-3) -18*a(n-4) +75*a(n-5) +55*a(n-6) -54*a(n-7) -102*a(n-8) -184*a(n-9) +36*a(n-10) +168*a(n-11) +136*a(n-12) +48*a(n-13) -96*a(n-14) -64*a(n-15)

%e Some solutions for n=4

%e ..0..0. .0..0. .0..0. .0..0. .0..1. .0..0. .0..1. .0..0. .0..1. .0..1

%e ..1..1. .0..0. .1..1. .0..0. .0..1. .0..0. .1..1. .0..0. .0..0. .0..1

%e ..1..1. .1..0. .1..1. .0..1. .1..1. .1..0. .1..1. .1..0. .0..0. .0..0

%e ..1..1. .0..1. .1..0. .1..1. .1..1. .1..0. .0..0. .1..1. .1..1. .0..0

%Y Cf. A281165.

%K nonn

%O 1,3

%A _R. H. Hardin_, Jan 16 2017