%I #5 Mar 20 2016 10:52:30
%S 0,36,312,8808,443088,44168712,8708857332,3419936238138,
%T 2684843924352546,4225663875817457520,13361604903790701175254,
%U 85018381019087710839691584,1089960283319115969602380739838,28183582557929760913921018421335722
%N Number of nXnXn triangular 0..3 arrays with some element plus some adjacent element totalling 3+1 or 3-1 exactly once.
%C Column 3 of A270606.
%H R. H. Hardin, <a href="/A270601/b270601.txt">Table of n, a(n) for n = 1..15</a>
%e Some solutions for n=4
%e .....0........3........3........1........3........3........3........1
%e ....0.3......0.2......3.3......3.0......0.3......0.3......3.0......3.0
%e ...1.0.0....3.3.3....0.2.3....3.0.3....0.0.0....0.3.3....3.3.3....0.0.3
%e ..3.0.3.3..3.3.0.0..0.3.3.3..0.3.0.0..0.1.1.0..1.3.3.0..2.0.0.0..0.0.0.0
%Y Cf. A270606.
%K nonn
%O 1,2
%A _R. H. Hardin_, Mar 20 2016