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.

A370366 Number A(n,k) of partitions of [k*n] into n sets of size k having no set of consecutive numbers whose maximum (if k>0) is a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 0
5 0
6 1
7 0
8 0
9 0
10 1
11 0
12 2
13 0
14 0
15 1
16 0
17 9
18 8
19 0
20 0
21 1
22 0
23 34
24 252
25 60
26 0
27 0
28 1
29 0
30 125
31 5672
32 14337
33 544
34 0
35 0
36 1
37 0
38 461
39 125750
40 2604732
41 1327104
42 6040
43 0
44 0
45 1
46 0
47 1715
48 2857472
49 488360625
50 2533087904
51 182407545
52 79008
53 0
54 0

List of values

[1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 1, 0, 9, 8, 0, 0, 1, 0, 34, 252, 60, 0, 0, 1, 0, 125, 5672, 14337, 544, 0, 0, 1, 0, 461, 125750, 2604732, 1327104, 6040, 0, 0, 1, 0, 1715, 2857472, 488360625, 2533087904, 182407545, 79008, 0, 0]