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.

A178979 Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the shortest block has length k (1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 1
4 4
5 0
6 1
7 11
8 3
9 0
10 1
11 41
12 10
13 0
14 0
15 1
16 162
17 30
18 10
19 0
20 0
21 1
22 715
23 126
24 35
25 0
26 0
27 0
28 1
29 3425
30 623
31 56
32 35
33 0
34 0
35 0
36 1
37 17722
38 2934
39 364
40 126
41 0
42 0
43 0
44 0
45 1
46 98253
47 15165
48 2220
49 210
50 126
51 0
52 0
53 0
54 0
55 1
56 580317
57 86900
58 10560
59 330
60 462
61 0
62 0
63 0
64 0
65 0
66 1

List of values

[1, 1, 1, 4, 0, 1, 11, 3, 0, 1, 41, 10, 0, 0, 1, 162, 30, 10, 0, 0, 1, 715, 126, 35, 0, 0, 0, 1, 3425, 623, 56, 35, 0, 0, 0, 1, 17722, 2934, 364, 126, 0, 0, 0, 0, 1, 98253, 15165, 2220, 210, 126, 0, 0, 0, 0, 1, 580317, 86900, 10560, 330, 462, 0, 0, 0, 0, 0, 1]