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.

A080510 Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 9
9 4
10 1
11 1
12 25
13 20
14 5
15 1
16 1
17 75
18 90
19 30
20 6
21 1
22 1
23 231
24 420
25 175
26 42
27 7
28 1
29 1
30 763
31 2016
32 1015
33 280
34 56
35 8
36 1
37 1
38 2619
39 10024
40 6111
41 1890
42 420
43 72
44 9
45 1
46 1
47 9495
48 51640
49 38010
50 12978
51 3150
52 600
53 90
54 10
55 1
56 1
57 35695
58 276980
59 244035
60 91938
61 24024
62 4950
63 825
64 110
65 11
66 1

List of values

[1, 1, 1, 1, 3, 1, 1, 9, 4, 1, 1, 25, 20, 5, 1, 1, 75, 90, 30, 6, 1, 1, 231, 420, 175, 42, 7, 1, 1, 763, 2016, 1015, 280, 56, 8, 1, 1, 2619, 10024, 6111, 1890, 420, 72, 9, 1, 1, 9495, 51640, 38010, 12978, 3150, 600, 90, 10, 1, 1, 35695, 276980, 244035, 91938, 24024, 4950, 825, 110, 11, 1]