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.

A202714 T(n,k)=Number of n X n 0..k arrays with row sums equal and no column sum equal to the previous.

Original entry on oeis.org

2, 3, 2, 4, 10, 38, 5, 28, 624, 838, 6, 60, 4740, 173860, 75302, 7, 110, 23036, 7788648, 421158558, 27842760, 8, 182, 83994, 147823100, 189412482924, 8496020082856, 37121438930, 9, 280, 250668, 1631287078
Offset: 1

Views

Author

R. H. Hardin Dec 23 2011

Keywords

Comments

Table starts
...........2.............3............4.........5..........6......7...8.9
...........2............10...........28........60........110....182.280
..........38...........624.........4740.....23036......83994.250668
.........838........173860......7788648.147823100.1631287078
.......75302.....421158558.189412482924
....27842760.8496020082856
.37121438930

Examples

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

Crossrefs

Row 2 is A006331