|
%I #4 Mar 14 2017 16:18:20
%S 8,57,264,1521,8687,47829,268285,1503392,8399236,46998162,262952663,
%T 1470846540,8228361722,46031489681,257506370211,1440540994224,
%U 8058660343663,45081605428482,252194893203897,1410825055629845
%N Number of 3Xn 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.
%C Row 3 of A283691.
%H R. H. Hardin, <a href="/A283693/b283693.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) +3*a(n-2) +15*a(n-3) -72*a(n-4) -21*a(n-5) +45*a(n-6) +96*a(n-7) +13*a(n-8) -115*a(n-9) +50*a(n-10) -14*a(n-11)
%e Some solutions for n=4
%e ..0..1..1..1. .0..1..0..0. .1..1..0..1. .0..0..0..1. .0..0..0..0
%e ..0..0..1..0. .0..0..0..1. .0..1..0..1. .0..1..0..0. .0..1..0..0
%e ..0..0..1..0. .0..1..0..1. .0..1..0..0. .1..1..0..1. .0..0..0..1
%Y Cf. A283691.
%K nonn
%O 1,1
%A _R. H. Hardin_, Mar 14 2017
| 