|
%I #8 Jan 17 2019 17:20:34
%S 27,336,2016,11664,63792,339480,1770048,9084744,46050480,231090264,
%T 1150053408,5683587048,27921925008,136471932792,664055030016,
%U 3218568401160,15545839096944,74855120204952,359437016141280
%N Number of 3 X n 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.
%H R. H. Hardin, <a href="/A268973/b268973.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n-1) - 29*a(n-2) + 20*a(n-3) - 4*a(n-4) for n>6.
%F Empirical g.f.: 3*x*(9 + 22*x - 187*x^2 + 236*x^3 - 332*x^4 + 280*x^5) / (1 - 5*x + 2*x^2)^2. - _Colin Barker_, Jan 17 2019
%e Some solutions for n=4:
%e ..1..2..1..0. .2..2..2..2. .1..2..2..2. .2..1..2..2. .0..1..2..2
%e ..1..2..0..1. .2..2..1..0. .1..2..2..1. .0..0..1..2. .0..1..2..1
%e ..1..0..0..0. .1..2..1..2. .0..1..0..0. .1..2..1..0. .0..1..2..1
%Y Row 3 of A268971.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 16 2016
| 