|
|
A267737
|
|
Number of nX3 arrays containing 3 copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0.
|
|
1
|
|
|
1, 10, 17, 26, 45, 82, 157, 306, 605, 1202, 2397, 4786, 9565, 19122, 38237, 76466, 152925, 305842, 611677, 1223346, 2446685, 4893362, 9786717, 19573426, 39146845, 78293682, 156587357, 313174706, 626349405, 1252698802, 2505397597, 5010795186
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..2....0..1..2....0..0..1....0..1..1....0..0..1....0..1..2....0..1..2
..2..2..3....1..2..2....0..1..1....2..2..3....0..1..2....2..3..3....1..2..3
..3..3..0....3..3..3....2..2..3....2..3..0....1..2..3....3..0..1....3..3..0
..0..1..1....0..0..1....2..3..3....3..0..1....2..3..3....0..1..2....0..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|