login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A219381
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..2 nXk array
13
3, 3, 6, 6, 7, 10, 10, 14, 23, 15, 15, 25, 84, 53, 21, 21, 40, 315, 344, 103, 28, 28, 66, 957, 2275, 1271, 182, 36, 36, 103, 2792, 11861, 15256, 4116, 302, 45, 45, 157, 7472, 60738, 143187, 88117, 12452, 478, 55, 55, 234, 18910, 278221, 1307685, 1487707, 471820
OFFSET
1,1
COMMENTS
Table starts
..3....3......6.......10.........15.........21..........28.........36........45
..6....7.....14.......25.........40.........66.........103........157.......234
.10...23.....84......315........957.......2792........7472......18910.....45821
.15...53....344.....2275......11861......60738......278221....1210223...4982663
.21..103...1271....15256.....143187....1307685....10491397...79639624.570036552
.28..182...4116....88117....1487707...23986853...336754108.4486562590
.36..302..12452...471820...14318103..409150493.10160088596
.45..478..35741..2391887..131239201.6702007395
.55..728..97942.11508779.1147488045
.66.1073.256627.52475021
.78.1537.644220
.91.2147
LINKS
EXAMPLE
Some solutions for n=3 k=4
..0..0..1..2....1..1..2..2....0..0..0..0....1..1..0..1....0..0..1..1
..0..0..0..2....1..1..2..2....1..0..0..0....1..0..0..0....1..0..1..1
..0..0..0..2....1..1..2..2....1..0..0..0....1..0..0..0....1..1..1..1
CROSSREFS
Column 1 is A000217(n+1)
Column 2 is A219167
Row 1 is A000217 for n>1
Sequence in context: A070318 A257537 A219883 * A219852 A023842 A165885
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Nov 19 2012
STATUS
approved