Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Feb 14 2017 07:53:02
%S 16,213,2048,23773,266425,2966724,33295509,372745151,4173376213,
%T 46739417550,523384918422,5860963933056,65632659610425,
%U 734967860658205,8230333458750528,92165106111769481,1032085136849026696
%N Number of nX4 0..1 arrays with no 1 equal to more than three of its king-move neighbors.
%C Column 4 of A282399.
%H R. H. Hardin, <a href="/A282395/b282395.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 8*a(n-1) +24*a(n-2) +155*a(n-3) -251*a(n-4) +195*a(n-5) -2577*a(n-6) +337*a(n-7) -4734*a(n-8) -38*a(n-9) -1066*a(n-10) -1924*a(n-11) +101*a(n-12) -437*a(n-13) +447*a(n-14) +128*a(n-15) +67*a(n-16) +34*a(n-17)
%e Some solutions for n=4
%e ..1..1..0..0. .0..0..0..0. .0..1..0..1. .0..0..0..0. .1..1..1..0
%e ..1..0..0..0. .1..1..1..1. .1..1..0..0. .1..0..0..1. .1..0..0..0
%e ..1..0..0..1. .1..0..0..0. .1..0..0..1. .0..0..1..0. .0..0..0..0
%e ..1..0..0..0. .1..0..0..1. .1..0..1..1. .0..0..0..1. .0..0..0..1
%Y Cf. A282399.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 14 2017