|
|
A183271
|
|
Half the number of nXnXn triangular binary arrays with the number of 0-0 adjacencies equal to the number of 1-1 adjacencies
|
|
1
|
|
|
1, 0, 0, 65, 1578, 0, 0, 1875535329, 839252581538, 0, 0, 5227844810759073967200, 39228698077486633860579435, 0, 0, 1102249786277252805957700361396650437576, 135380785027014267422923708062639569342712090, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
a(n)=0 for n mod 4 = 2 or 3 because the number of edges is odd and flipping a 0 to a 1 changes the relative counts by an even number
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 4X4X4 with a(1,1)=0 and equal 0-0 and 1-1 adjacencies
.....0........0........0........0........0........0........0........0
....1.0......1.0......0.0......1.0......1.1......1.0......0.1......1.1
...1.0.0....1.0.0....1.0.1....1.0.1....0.1.1....0.0.1....1.0.1....0.0.0
..1.1.1.0..0.1.1.1..0.1.1.1..1.1.0.0..0.0.0.0..0.1.1.1..0.1.0.1..1.1.1.0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|