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.

A086659 T(n,k) counts the set partitions of n containing k-1 blocks of length 1.

Table of values

n a(n)
2 1
3 1
4 3
5 4
6 4
7 6
8 11
9 20
10 10
11 10
12 41
13 66
14 60
15 20
16 15
17 162
18 287
19 231
20 140
21 35
22 21
23 715
24 1296
25 1148
26 616
27 280
28 56
29 28
30 3425
31 6435
32 5832
33 3444
34 1386
35 504
36 84
37 36
38 17722
39 34250
40 32175
41 19440
42 8610
43 2772
44 840
45 120
46 45
47 98253
48 194942
49 188375
50 117975
51 53460
52 18942
53 5082
54 1320
55 165
56 55

List of values

[1, 1, 3, 4, 4, 6, 11, 20, 10, 10, 41, 66, 60, 20, 15, 162, 287, 231, 140, 35, 21, 715, 1296, 1148, 616, 280, 56, 28, 3425, 6435, 5832, 3444, 1386, 504, 84, 36, 17722, 34250, 32175, 19440, 8610, 2772, 840, 120, 45, 98253, 194942, 188375, 117975, 53460, 18942, 5082, 1320, 165, 55]