|
|
A220109
|
|
T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nXk array
|
|
3
|
|
|
4, 16, 16, 56, 256, 56, 250, 4020, 4020, 250, 984, 64862, 252520, 64862, 984, 3888, 1029672, 16187862, 16187862, 1029672, 3888, 15798, 16468836, 1028824446, 4160361190, 1028824446, 16468836, 15798, 63092, 262860066, 65676456950
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
.....4.......16.........56........250........984........3888.....15798.63092
....16......256.......4020......64862....1029672....16468836.262860066
....56.....4020.....252520...16187862.1028824446.65676456950
...250....64862...16187862.4160361190
...984..1029672.1028824446
..3888.16468836
.15798
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..0..0..2..3....0..0..0..2....1..0..1..3....0..0..0..2....0..0..2..1
..0..0..3..2....0..0..3..1....0..0..2..1....0..0..3..1....0..0..0..2
..0..1..1..1....0..0..1..3....0..0..2..1....1..0..3..0....1..3..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|