|
|
A193752
|
|
Number of nXnXn triangular 0..1 arrays with no element equal to the sum mod 2 of all its neighbors
|
|
0
|
|
|
1, 4, 1, 1, 4, 16, 1, 1, 1, 4, 1, 16, 16, 1024, 1, 1, 1, 4, 256, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 6X6X6
.......1............0............0............0............1............0
......0.0..........0.1..........1.0..........1.0..........0.0..........0.1
.....0.0.0........0.0.0........0.0.0........0.0.0........1.1.1........1.1.1
....0.1.0.1......1.0.0.0......1.1.1.0......0.0.0.1......0.1.1.0......0.1.0.0
...0.0.0.1.1....1.1.1.0.1....0.1.1.0.0....1.0.1.1.1....1.0.1.0.1....1.0.0.0.0
..1.0.0.1.1.1..0.0.1.0.1.1..1.0.1.0.1.0..1.1.0.1.0.0..0.0.0.0.0.0..1.1.0.0.1.0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|