login
Number of n X 3 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.
1

%I #8 Jan 17 2019 09:20:23

%S 24,240,2016,15552,114048,808704,5598720,38071296,255301632,

%T 1693052928,11125776384,72559411200,470184984576,3030081011712,

%U 19434312695808,124128835928064,789910774087680,5010291195641856,31686706480545792

%N Number of n X 3 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="/A268966/b268966.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 12*a(n-1) - 36*a(n-2).

%F Conjectures from _Colin Barker_, Jan 17 2019: (Start)

%F G.f.: 24*x*(1 - 2*x) / (1 - 6*x)^2.

%F a(n) = 2^(n+2) * 3^(n-1) * (2*n+1).

%F (End)

%e Some solutions for n=4:

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

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

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

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

%Y Column 3 of A268971.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 16 2016