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.

A108458 Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the last block is the singleton {k}, 1<=k<=n; the blocks are ordered with increasing least elements.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 2
7 0
8 1
9 3
10 5
11 0
12 1
13 5
14 10
15 15
16 0
17 1
18 9
19 22
20 37
21 52
22 0
23 1
24 17
25 52
26 99
27 151
28 203
29 0
30 1
31 33
32 130
33 283
34 471
35 674
36 877
37 0
38 1
39 65
40 340
41 855
42 1561
43 2386
44 3263
45 4140
46 0
47 1
48 129
49 922
50 2707
51 5451
52 8930
53 12867
54 17007
55 21147
56 0
57 1
58 257
59 2572
60 8919
61 19921
62 35098
63 53411
64 73681
65 94828
66 115975

List of values

[1, 0, 1, 0, 1, 2, 0, 1, 3, 5, 0, 1, 5, 10, 15, 0, 1, 9, 22, 37, 52, 0, 1, 17, 52, 99, 151, 203, 0, 1, 33, 130, 283, 471, 674, 877, 0, 1, 65, 340, 855, 1561, 2386, 3263, 4140, 0, 1, 129, 922, 2707, 5451, 8930, 12867, 17007, 21147, 0, 1, 257, 2572, 8919, 19921, 35098, 53411, 73681, 94828, 115975]