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.

A275043 Number A(n,k) of set partitions of [k*n] such that within each block the numbers of elements from all residue classes modulo k are equal for k>0, A(n,0)=1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 1
10 1
11 1
12 3
13 5
14 1
15 1
16 1
17 5
18 16
19 15
20 1
21 1
22 1
23 9
24 64
25 131
26 52
27 1
28 1
29 1
30 17
31 298
32 1613
33 1496
34 203
35 1
36 1
37 1
38 33
39 1540
40 25097
41 69026
42 22482
43 877
44 1
45 1
46 1
47 65
48 8506
49 461105
50 4383626
51 4566992
52 426833
53 4140
54 1
55 1
56 1
57 129
58 48844
59 9483041
60 350813126
61 1394519922
62 437665649
63 9934563
64 21147
65 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 5, 1, 1, 1, 5, 16, 15, 1, 1, 1, 9, 64, 131, 52, 1, 1, 1, 17, 298, 1613, 1496, 203, 1, 1, 1, 33, 1540, 25097, 69026, 22482, 877, 1, 1, 1, 65, 8506, 461105, 4383626, 4566992, 426833, 4140, 1, 1, 1, 129, 48844, 9483041, 350813126, 1394519922, 437665649, 9934563, 21147, 1]