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.

A283424 Number T(n,k) of blocks of size >= k in all set partitions of [n], assuming that every set partition contains one block of size zero; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 2
2 1
3 5
4 3
5 1
6 15
7 10
8 4
9 1
10 52
11 37
12 17
13 5
14 1
15 203
16 151
17 76
18 26
19 6
20 1
21 877
22 674
23 362
24 137
25 37
26 7
27 1
28 4140
29 3263
30 1842
31 750
32 225
33 50
34 8
35 1
36 21147
37 17007
38 9991
39 4307
40 1395
41 345
42 65
43 9
44 1
45 115975
46 94828
47 57568
48 25996
49 8944
50 2392
51 502
52 82
53 10
54 1

List of values

[1, 2, 1, 5, 3, 1, 15, 10, 4, 1, 52, 37, 17, 5, 1, 203, 151, 76, 26, 6, 1, 877, 674, 362, 137, 37, 7, 1, 4140, 3263, 1842, 750, 225, 50, 8, 1, 21147, 17007, 9991, 4307, 1395, 345, 65, 9, 1, 115975, 94828, 57568, 25996, 8944, 2392, 502, 82, 10, 1]