|
|
A270601
|
|
Number of nXnXn triangular 0..3 arrays with some element plus some adjacent element totalling 3+1 or 3-1 exactly once.
|
|
1
|
|
|
0, 36, 312, 8808, 443088, 44168712, 8708857332, 3419936238138, 2684843924352546, 4225663875817457520, 13361604903790701175254, 85018381019087710839691584, 1089960283319115969602380739838, 28183582557929760913921018421335722
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
.....0........3........3........1........3........3........3........1
....0.3......0.2......3.3......3.0......0.3......0.3......3.0......3.0
...1.0.0....3.3.3....0.2.3....3.0.3....0.0.0....0.3.3....3.3.3....0.0.3
..3.0.3.3..3.3.0.0..0.3.3.3..0.3.0.0..0.1.1.0..1.3.3.0..2.0.0.0..0.0.0.0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|