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.

A324162 Number T(n,k) of set partitions of [n] where each subset is again partitioned into k nonempty subsets; 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 2
5 1
6 0
7 5
8 3
9 1
10 0
11 15
12 10
13 6
14 1
15 0
16 52
17 45
18 25
19 10
20 1
21 0
22 203
23 241
24 100
25 65
26 15
27 1
28 0
29 877
30 1428
31 511
32 350
33 140
34 21
35 1
36 0
37 4140
38 9325
39 3626
40 1736
41 1050
42 266
43 28
44 1
45 0
46 21147
47 67035
48 29765
49 9030
50 6951
51 2646
52 462
53 36
54 1
55 0
56 115975
57 524926
58 250200
59 60355
60 42651
61 22827
62 5880
63 750
64 45
65 1

List of values

[1, 0, 1, 0, 2, 1, 0, 5, 3, 1, 0, 15, 10, 6, 1, 0, 52, 45, 25, 10, 1, 0, 203, 241, 100, 65, 15, 1, 0, 877, 1428, 511, 350, 140, 21, 1, 0, 4140, 9325, 3626, 1736, 1050, 266, 28, 1, 0, 21147, 67035, 29765, 9030, 6951, 2646, 462, 36, 1, 0, 115975, 524926, 250200, 60355, 42651, 22827, 5880, 750, 45, 1]