|
|
A270252
|
|
Number of nXnXn triangular 0..3 arrays with some element plus some adjacent element totalling 3 exactly once.
|
|
0
|
|
|
0, 24, 768, 37848, 3280968, 534438768, 168922341960, 105517892702664, 131753433792113808, 331340420421242860608, 1687124453705206024927056, 17459534608150280430379207968, 368268947135078917128505577185992
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
.....2........3........3........3........3........1........0........2
....2.2......2.0......3.3......3.2......2.3......0.0......3.2......0.2
...3.3.0....2.2.0....1.1.1....0.2.0....3.2.0....2.0.1....2.2.3....0.0.1
..1.1.1.0..2.2.2.2..2.3.1.0..0.0.2.0..2.2.0.0..2.2.2.3..2.3.3.3..2.0.0.1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|