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.

A381891 Triangle read by rows: T(n,k) is the number of partitions of a 2-colored set of n objects into at most k parts with 0 <= k <= n.

Table of values

n a(n)
0 1
1 0
2 2
3 0
4 3
5 6
6 0
7 4
8 10
9 14
10 0
11 5
12 19
13 28
14 33
15 0
16 6
17 28
18 52
19 64
20 70
21 0
22 7
23 44
24 93
25 127
26 142
27 149
28 0
29 8
30 60
31 152
32 228
33 272
34 290
35 298
36 0
37 9
38 85
39 242
40 404
41 507
42 561
43 582
44 591
45 0
46 10
47 110
48 370
49 672
50 904
51 1034
52 1098
53 1122
54 1132
55 0
56 11
57 146
58 546
59 1100
60 1568
61 1870
62 2027
63 2101
64 2128
65 2139

List of values

[1, 0, 2, 0, 3, 6, 0, 4, 10, 14, 0, 5, 19, 28, 33, 0, 6, 28, 52, 64, 70, 0, 7, 44, 93, 127, 142, 149, 0, 8, 60, 152, 228, 272, 290, 298, 0, 9, 85, 242, 404, 507, 561, 582, 591, 0, 10, 110, 370, 672, 904, 1034, 1098, 1122, 1132, 0, 11, 146, 546, 1100, 1568, 1870, 2027, 2101, 2128, 2139]