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.

Showing 1-1 of 1 results.

A201235 T(n,k)=Number of nXk 0..3 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

4, 6, 6, 7, 2, 7, 3, 34, 34, 3, 17, 24, 114, 24, 17, 40, 306, 140, 140, 306, 40, 46, 152, 2462, 1028, 2462, 152, 46, 21, 2697, 18056, 7791, 7791, 18056, 2697, 21, 135, 1709, 62133, 66027, 420662, 66027, 62133, 1709, 135, 342, 26353, 82861, 508368, 8499558
Offset: 1

Views

Author

R. H. Hardin Nov 28 2011

Keywords

Comments

Table starts
...4.....6........7.........3...........17............40............46
...6.....2.......34........24..........306...........152..........2697
...7....34......114.......140.........2462.........18056.........62133
...3....24......140......1028.........7791.........66027........508368
..17...306.....2462......7791.......420662.......8499558......77620598
..40...152....18056.....66027......8499558......33222962....4442977704
..46..2697....62133....508368.....77620598....4442977704..112920979339
..21..1709....82861...4293464....263388703...17052604235.1076710643794
.135.26353..1593643..33177954..14079281158.2254057282528
.342.14274.11978376.282310785.283246971698

Examples

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

Crossrefs

Column 1 is A200939
Showing 1-1 of 1 results.