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.

A327884 Number T(n,k) of set partitions of [n] such that at least one of the block sizes is k or k=0; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 1
6 5
7 4
8 3
9 1
10 15
11 11
12 9
13 4
14 1
15 52
16 41
17 35
18 20
19 5
20 1
21 203
22 162
23 150
24 90
25 30
26 6
27 1
28 877
29 715
30 672
31 455
32 175
33 42
34 7
35 1
36 4140
37 3425
38 3269
39 2352
40 1015
41 280
42 56
43 8
44 1
45 21147
46 17722
47 17271
48 13132
49 6237
50 1890
51 420
52 72
53 9
54 1
55 115975
56 98253
57 97155
58 76540
59 39480
60 12978
61 3150
62 600
63 90
64 10
65 1

List of values

[1, 1, 1, 2, 1, 1, 5, 4, 3, 1, 15, 11, 9, 4, 1, 52, 41, 35, 20, 5, 1, 203, 162, 150, 90, 30, 6, 1, 877, 715, 672, 455, 175, 42, 7, 1, 4140, 3425, 3269, 2352, 1015, 280, 56, 8, 1, 21147, 17722, 17271, 13132, 6237, 1890, 420, 72, 9, 1, 115975, 98253, 97155, 76540, 39480, 12978, 3150, 600, 90, 10, 1]