|
|
A219828
|
|
T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array
|
|
13
|
|
|
4, 4, 10, 10, 13, 20, 20, 38, 60, 35, 35, 87, 394, 193, 56, 56, 176, 2106, 2673, 514, 84, 84, 370, 9920, 29403, 16137, 1231, 120, 120, 721, 45471, 278027, 372346, 84635, 2748, 165, 165, 1374, 186016, 2563318, 7468429, 4032736, 413442, 5802, 220, 220, 2533
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
...4.....4......10........20.........35.........56.........84.........120
..10....13......38........87........176........370........721........1374
..20....60.....394......2106.......9920......45471.....186016......724385
..35...193....2673.....29403.....278027....2563318...20765879...161504901
..56...514...16137....372346....7468429..142482220.2362961573.37398063014
..84..1231...84635...4032736..170199321.6596370468
.120..2748..413442..40480756.3570274220
.165..5802.1912366.386360710
.220.11665.8425696
.286.22432
.364
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..0..0..0..1....0..0..0..1....0..0..2..2....0..0..0..0....0..0..0..3
..0..0..0..0....0..0..0..0....1..0..2..2....0..0..0..0....0..0..0..1
..1..1..0..0....3..1..0..2....2..1..3..2....2..2..1..2....2..0..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|