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.

A285824 Number T(n,k) of ordered set partitions of [n] into k blocks such that equal-sized blocks are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 6
9 1
10 0
11 1
12 11
13 18
14 1
15 0
16 1
17 30
18 75
19 40
20 1
21 0
22 1
23 52
24 420
25 350
26 75
27 1
28 0
29 1
30 126
31 1218
32 3080
33 1225
34 126
35 1
36 0
37 1
38 219
39 4242
40 17129
41 15750
42 3486
43 196
44 1
45 0
46 1
47 510
48 14563
49 82488
50 152355
51 63756
52 8526
53 288
54 1
55 0
56 1
57 896
58 42930
59 464650
60 1049895
61 954387
62 217560
63 18600
64 405
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 6, 1, 0, 1, 11, 18, 1, 0, 1, 30, 75, 40, 1, 0, 1, 52, 420, 350, 75, 1, 0, 1, 126, 1218, 3080, 1225, 126, 1, 0, 1, 219, 4242, 17129, 15750, 3486, 196, 1, 0, 1, 510, 14563, 82488, 152355, 63756, 8526, 288, 1, 0, 1, 896, 42930, 464650, 1049895, 954387, 217560, 18600, 405, 1]