|
|
A203594
|
|
Number of nX1 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
|
|
1
|
|
|
3, 9, 18, 26, 26, 12, 98, 366, 796, 996, 534, 5366, 23308, 56516, 75120, 41600, 448400, 2053480, 5180820, 7049350, 3952950, 44504530, 210527016, 543851924, 750110424, 423385872, 4900761656, 23667951384, 62074790736, 86372858208, 48953570736
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..1....0....1....1....2....1....1....2....0....1....0....1....2....0....2....1
..0....0....2....0....2....0....0....2....0....1....1....2....1....1....0....1
..0....2....0....0....0....0....0....1....1....0....2....2....0....2....1....2
..2....2....1....2....0....2....2....1....2....0....0....0....2....0....2....2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|