login
Number of nXnXn triangular 0..1 arrays with each element equal to the sum mod 2 of two neighbors
1

%I #6 Mar 31 2012 12:36:21

%S 0,4,8,126,3269,169942,17345573,3495586809,1389897952334,

%T 1090163075958998,1686816727834550231,5148938004752209696533,

%U 31005486113751088602024098,368324363978199003012362844935

%N Number of nXnXn triangular 0..1 arrays with each element equal to the sum mod 2 of two neighbors

%H R. H. Hardin, <a href="/A193155/b193155.txt">Table of n, a(n) for n = 1..17</a>

%e Some solutions for 4X4X4

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

%e ....1.1......1.0......1.1......0.0......1.1......1.0......1.0......0.1

%e ...0.1.0....1.0.0....0.0.0....1.1.1....1.1.0....0.1.0....0.1.1....1.0.0

%e ..1.1.1.1..1.0.1.1..1.1.1.1..0.1.0.1..0.1.1.1..0.0.1.1..0.0.0.1..0.1.1.1

%K nonn

%O 1,2

%A _R. H. Hardin_ Jul 16 2011