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.

A223663 T(n,k) = Number of n X k 0..3 arrays with row sums unimodal and column sums inverted unimodal.

Original entry on oeis.org

4, 16, 16, 50, 256, 50, 130, 3060, 3060, 130, 296, 29922, 141046, 29922, 296, 610, 252912, 5285887, 5285887, 252912, 610, 1163, 1912914, 169756788, 761845474, 169756788, 1912914, 1163, 2083, 13254601, 4836834467, 93974096640, 93974096640
Offset: 1

Views

Author

R. H. Hardin, Mar 25 2013

Keywords

Comments

Table starts
....4........16............50..............130...............296
...16.......256..........3060............29922............252912
...50......3060........141046..........5285887.........169756788
..130.....29922.......5285887........761845474.......93974096640
..296....252912.....169756788......93974096640....44626165058452
..610...1912914....4836834467...10253839694278.18744540823704239
.1163..13254601..125226945708.1013084819998517
.2083..85563043.2997363216275
.3544.521069404
.5776

Examples

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