

A183273


Half the number of nXnXn triangular binary arrays with the number of 00 adjacencies differing from the number of 11 adjacencies by one or less


1



1, 3, 12, 65, 1578, 160098, 17065221, 1875535329, 839252581538, 1524001061360475, 2807101769922368808, 5227844810759073967200, 39228698077486633860579435, 1184998883345176952277627211488, 36038790171982413365368096113544968
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Counts will differ by one when n mod 4 = 2 or 3


LINKS



EXAMPLE

All solutions for 3X3X3 with a(1,1)=0 and 00 and 11 adjacencies differing by 1 or less
....0......0......0......0......0......0......0......0......0......0......0......0
...1.1....0.0....0.1....0.1....1.1....1.0....1.0....1.0....1.0....0.1....1.1....0.1
..0.0.0..1.1.1..1.1.0..0.1.0..1.0.0..1.0.1..1.1.0..0.1.1..0.1.0..0.1.1..0.0.1..1.0.1


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



