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.

A268367 T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with row sums equal.

Original entry on oeis.org

1, 1, 0, 1, 4, 0, 1, 0, 12, 0, 1, 36, 216, 96, 0, 1, 0, 2700, 0, 480, 0, 1, 400, 54000, 643680, 116640, 5760, 0, 1, 0, 1054200, 0, 190188000, 0, 40320, 0, 1, 4900, 20991600, 12243840000, 269568000000, 128247235200, 535610880, 645120, 0, 1, 0, 445365900
Offset: 1

Views

Author

R. H. Hardin, Feb 03 2016

Keywords

Comments

Table starts
.1.......1.........1...............1............1...............1........1
.0.......4.........0..............36............0.............400........0
.0......12.......216............2700........54000.........1054200.20991600
.0......96.........0..........643680............0.....12243840000........0
.0.....480....116640.......190188000.269568000000.429355384500000
.0....5760.........0....128247235200............0
.0...40320.535610880.114921318153600
.0..645120.........0
.0.5806080
.0

Examples

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