|
|
A193323
|
|
Number of nXnXn triangular 0..1 arrays with each element equal to the product mod 2 of two neighbors
|
|
0
|
|
|
0, 2, 5, 35, 536, 14925, 793364, 78403900, 14523841634, 5077912263585, 3333988310175135, 4109919842182410230, 9524298796836830690410, 41479594927306884269307590
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 4X4X4
.....0........1........0........0........1........0........0........1
....0.0......1.1......0.1......0.1......1.1......1.0......0.0......1.1
...0.1.1....0.1.1....1.1.1....1.1.1....0.0.0....1.1.0....1.1.1....1.1.1
..0.1.1.1..0.1.1.1..1.1.0.0..1.1.1.1..0.0.0.0..0.0.0.0..1.1.1.1..1.1.0.0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|