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.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 4
6 0
7 1
8 0
9 12
10 0
11 1
12 36
13 216
14 96
15 0
16 1
17 0
18 2700
19 0
20 480
21 0
22 1
23 400
24 54000
25 643680
26 116640
27 5760
28 0
29 1
30 0
31 1054200
32 0
33 190188000
34 0
35 40320
36 0
37 1
38 4900
39 20991600
40 12243840000
41 269568000000
42 128247235200
43 535610880
44 645120
45 0
46 1
47 0
48 445365900

List of values

[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]