cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A219595 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array.

Original entry on oeis.org

3, 3, 3, 6, 7, 6, 10, 18, 21, 10, 15, 34, 84, 46, 15, 21, 55, 233, 264, 87, 21, 28, 81, 550, 1114, 705, 151, 28, 36, 112, 1188, 4152, 4350, 1739, 247, 36, 45, 148, 2415, 14793, 26006, 16117, 4129, 386, 45, 55, 189, 4684, 51122, 156964, 164075, 60252, 9518, 581
Offset: 1

Views

Author

R. H. Hardin Nov 23 2012

Keywords

Comments

Table starts
..3....3.....6......10.......15........21........28........36.........45
..3....7....18......34.......55........81.......112.......148........189
..6...21....84.....233......550......1188......2415......4684.......8746
.10...46...264....1114.....4152.....14793.....51122....170728.....550156
.15...87...705....4350....26006....156964....939006...5466749...30837420
.21..151..1739...16117...164075...1767430..18945258.197089634.1981970463
.28..247..4129...60252..1093496..21435360.415752625
.36..386..9518..226309..7362866.259297241
.45..581.21271..831045.47724022
.55..847.46019.2932198
.66.1201.96412
.78.1662

Examples

			Some solutions for n=3 k=4
..1..1..0..0....0..0..0..0....0..0..0..0....1..1..0..0....2..1..0..0
..1..1..1..0....1..0..0..0....1..0..0..0....1..1..1..0....2..1..1..0
..1..1..0..0....1..2..2..1....1..2..0..0....2..2..0..0....2..1..1..1
		

Crossrefs

Row and Column 1 are A000217 for n>1
Row 2 is A000566 for n>1