|
|
A203600
|
|
T(n,k)=Number of nXk 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
|
|
8
|
|
|
3, 9, 9, 18, 16, 18, 26, 46, 46, 26, 26, 16, 172, 16, 26, 12, 596, 1430, 1430, 596, 12, 98, 936, 17452, 20000, 17452, 936, 98, 366, 5326, 225034, 584450, 584450, 225034, 5326, 366, 796, 64452, 3278068, 37380604, 8227090, 37380604, 3278068, 64452, 796, 996
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
...3.....9.......18........26.........26.........12........98.........366
...9....16.......46........16........596........936......5326.......64452
..18....46......172......1430......17452.....225034...3278068....44996822
..26....16.....1430.....20000.....584450...37380604.126312616.51978629884
..26...596....17452....584450....8227090.3806301462
..12...936...225034..37380604.3806301462
..98..5326..3278068.126312616
.366.64452.44996822
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=5 k=3
..1..0..0....0..1..2....2..2..2....0..0..0....1..0..0....2..1..0....1..1..0
..1..1..0....0..2..2....1..2..1....1..1..0....1..2..2....1..0..0....2..2..0
..2..0..0....2..1..2....0..0..2....1..2..2....1..2..2....1..2..0....2..1..0
..2..2..2....2..0..0....0..0..2....0..2..1....0..1..2....2..2..0....2..0..0
..1..2..1....0..0..1....1..1..0....0..2..2....0..0..0....2..2..1....2..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|