|
%I #4 Jan 14 2017 11:59:48
%S 0,92,894,3330,10954,32244,89147,236332,609693,1542674,3849427,
%T 9505656,23280649,56635936,137005695,329823586,790661565,1888351302,
%U 4495083545,10668575466,25253243659,59632117024,140504745763,330394273406
%N Number of nX5 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C Column 5 of A281080.
%H R. H. Hardin, <a href="/A281077/b281077.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 9*a(n-1) -32*a(n-2) +56*a(n-3) -48*a(n-4) +16*a(n-5) +4*a(n-6) -20*a(n-7) +26*a(n-8) +18*a(n-9) -66*a(n-10) +46*a(n-11) -6*a(n-12) +6*a(n-13) -4*a(n-14) -12*a(n-15) -5*a(n-16) +25*a(n-17) -6*a(n-18) -10*a(n-19) -3*a(n-20) +11*a(n-21) -2*a(n-22) -2*a(n-23) -a(n-24) +a(n-25) for n>32
%e Some solutions for n=4
%e ..0..0..1..1..1. .0..0..1..1..0. .0..0..1..1..0. .0..1..0..0..1
%e ..1..1..0..0..1. .0..1..0..1..1. .1..1..0..1..0. .1..0..1..0..1
%e ..0..0..1..0..0. .1..0..1..0..1. .1..0..1..0..1. .0..1..1..0..1
%e ..1..0..1..1..0. .1..1..0..0..1. .0..1..0..1..0. .0..0..1..0..0
%Y Cf. A281080.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 14 2017
| 