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.

A201033 T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.

Original entry on oeis.org

5, 10, 10, 17, 10, 17, 15, 41, 41, 15, 8, 295, 296, 295, 8, 61, 159, 4238, 4238, 159, 61, 206, 4587, 3602, 30157, 3602, 4587, 206, 410, 8476, 249211, 96844, 96844, 249211, 8476, 410, 426, 33401, 1055902, 6814915, 2579473, 6814915, 1055902, 33401, 426
Offset: 1

Views

Author

R. H. Hardin Nov 26 2011

Keywords

Comments

Table starts
...5.....10........17.........15..........8..........61........206.........410
..10.....10........41........295........159........4587.......8476.......33401
..17.....41.......296.......4238.......3602......249211....1055902.....8657121
..15....295......4238......30157......96844.....6814915..221032490..3642791292
...8....159......3602......96844....2579473....78447852.2410888256.76028824895
..61...4587....249211....6814915...78447852.21586894705
.206...8476...1055902..221032490.2410888256
.410..33401...8657121.3642791292
.426.272191.141222119
.228.128622

Examples

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

Crossrefs

Column 1 is A200940