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.

A371788 Triangle read by rows where T(n,k) is the number of set partitions of {1..n} with exactly k distinct block-sums.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 2
8 2
9 1
10 0
11 2
12 8
13 4
14 1
15 0
16 2
17 19
18 24
19 6
20 1
21 0
22 2
23 47
24 95
25 49
26 9
27 1
28 0
29 6
30 105
31 363
32 297
33 93
34 12
35 1
36 0
37 12
38 248
39 1292
40 1660
41 753
42 158
43 16
44 1
45 0
46 11
47 563
48 4649
49 8409
50 5591
51 1653
52 250
53 20
54 1
55 0
56 2
57 1414
58 15976
59 41264
60 38074
61 15590
62 3249
63 380
64 25
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 2, 8, 4, 1, 0, 2, 19, 24, 6, 1, 0, 2, 47, 95, 49, 9, 1, 0, 6, 105, 363, 297, 93, 12, 1, 0, 12, 248, 1292, 1660, 753, 158, 16, 1, 0, 11, 563, 4649, 8409, 5591, 1653, 250, 20, 1, 0, 2, 1414, 15976, 41264, 38074, 15590, 3249, 380, 25, 1]