|
|
A193367
|
|
Number of nXnXn triangular 0..2 arrays with no element equal to the product mod 3 of any two neighbors
|
|
1
|
|
|
3, 16, 26, 65, 384, 3318, 40638, 689636, 16383974, 542420394, 25075022590, 1617185558560, 145563089994148, 18283036276489970, 3204638749437865046, 783848125594781710150, 267554112823378352976752
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 4X4X4
.....0........2........2........0........2........2........0........2
....2.2......0.2......2.2......1.2......0.2......0.2......2.2......2.2
...2.2.2....2.2.0....2.0.2....1.0.1....2.2.0....2.2.2....2.2.0....0.2.2
..2.0.2.0..2.0.2.2..2.2.2.0..0.2.1.0..0.2.2.2..0.2.0.2..2.0.2.2..2.2.2.0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|