|
|
A220044
|
|
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 nonincreasing columns, 0..3 nXk array
|
|
13
|
|
|
4, 4, 10, 10, 13, 20, 20, 25, 59, 35, 35, 50, 184, 181, 56, 56, 90, 848, 927, 469, 84, 84, 152, 2902, 8337, 4415, 1107, 120, 120, 249, 9055, 53266, 74547, 19083, 2447, 165, 165, 397, 26963, 313386, 904715, 595862, 79295, 5120, 220, 220, 618, 76874, 1746346
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
...4.....4......10.......20........35........56........84........120......165
..10....13......25.......50........90.......152.......249........397......618
..20....59.....184......848......2902......9055.....26963......76874...211179
..35...181.....927.....8337.....53266....313386...1746346....9367123.48895966
..56...469....4415....74547....904715..10478150.115306521.1239077832
..84..1107...19083...595862..13639469.310371126
.120..2447...79295..4640546.201839765
.165..5120..321566.35547836
.220.10197.1259568
.286.19415
.364
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..71
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..2..0..0..0....2..1..0..0....0..0..0..0....2..2..2..2....2..2..0..1
..2..0..0..0....2..1..0..0....0..0..0..0....2..2..1..2....2..1..0..0
..3..2..0..0....2..1..0..1....3..2..2..3....3..2..1..1....2..1..0..0
|
|
CROSSREFS
|
Column 1 is A000292(n+1)
Column 2 is A219572
Row 1 is A000292 for n>1
Sequence in context: A078910 A196051 A140234 * A219828 A219714 A167132
Adjacent sequences: A220041 A220042 A220043 * A220045 A220046 A220047
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
R. H. Hardin Dec 03 2012
|
|
STATUS
|
approved
|
|
|
|