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.

A208437 Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 5
6 10
7 2
8 50
9 27
10 116
11 60
12 2
13 560
14 315
15 142
16 1730
17 2268
18 282
19 6123
20 14742
21 1073
22 30122
23 72180
24 12600
25 2
26 116908
27 464640
28 97020
29 32034
30 507277
31 2676366
32 997920
33 2
34 2492737
35 16400098
36 8751600
37 136853
38 15328119
39 94209206
40 81225144
41 1527528
42 56182092
43 673282610
44 614128515
45 37837800

List of values

[1, 2, 2, 3, 5, 10, 2, 50, 27, 116, 60, 2, 560, 315, 142, 1730, 2268, 282, 6123, 14742, 1073, 30122, 72180, 12600, 2, 116908, 464640, 97020, 32034, 507277, 2676366, 997920, 2, 2492737, 16400098, 8751600, 136853, 15328119, 94209206, 81225144, 1527528, 56182092, 673282610, 614128515, 37837800]