|
| |
|
|
A193119
|
|
Number of n X n symmetric 0..2 arrays with each element equal to the sum mod 3 of two of its horizontal and vertical neighbors
|
|
0
|
|
|
|
0, 3, 15, 423, 36303, 7680999, 4383590853, 6620035953435, 26650313780374809, 285770102208737032155, 8165008854368644741356393, 621615056698159819880932698345
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for 4X4
..1..2..1..1....1..2..0..0....1..2..1..1....2..1..2..0....1..2..1..2
..2..1..0..0....2..1..0..0....2..1..2..0....1..2..1..1....2..1..2..1
..1..0..2..2....0..0..2..1....1..2..1..0....2..1..0..0....1..2..0..1
..1..0..2..1....0..0..1..2....1..0..0..0....0..1..0..0....2..1..1..2
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
