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.

A203986 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of {1,2,...,k*n} into n k-element subsets having the same sum.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 0
9 1
10 1
11 1
12 1
13 0
14 1
15 1
16 1
17 0
18 1
19 0
20 1
21 1
22 1
23 4
24 2
25 1
26 0
27 1
28 1
29 1
30 0
31 32
32 0
33 1
34 0
35 1
36 1
37 1
38 29
39 305
40 392
41 11
42 1
43 0
44 1
45 1
46 1
47 0
48 4331
49 0
50 6883
51 0
52 1
53 0
54 1
55 1
56 1
57 263
58 63261
59 2097719
60 3245664
61 171088
62 84
63 1
64 0
65 1
66 1
67 1
68 0
69 1025113
70 0
71 2549091482
72 0
73 5661874
74 0
75 1
76 0
77 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 4, 2, 1, 0, 1, 1, 1, 0, 32, 0, 1, 0, 1, 1, 1, 29, 305, 392, 11, 1, 0, 1, 1, 1, 0, 4331, 0, 6883, 0, 1, 0, 1, 1, 1, 263, 63261, 2097719, 3245664, 171088, 84, 1, 0, 1, 1, 1, 0, 1025113, 0, 2549091482, 0, 5661874, 0, 1, 0, 1]