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.

A239499 Number of partitions p of n such that if h = (number of parts of p), then h is an (h,2)-separator of p; see Comments.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 0
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 2
18 2
19 3
20 3
21 3
22 3
23 4
24 4
25 5
26 5
27 6
28 6
29 7
30 7
31 9
32 9
33 11
34 12
35 14
36 15
37 17
38 18
39 20
40 22
41 24
42 26
43 29
44 31
45 34
46 37
47 40
48 43
49 48
50 51
51 56
52 61
53 67
54 72
55 80
56 86
57 94
58 102
59 111
60 119
61 131
62 140
63 152
64 164
65 178
66 190
67 207
68 221
69 239

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 9, 9, 11, 12, 14, 15, 17, 18, 20, 22, 24, 26, 29, 31, 34, 37, 40, 43, 48, 51, 56, 61, 67, 72, 80, 86, 94, 102, 111, 119, 131, 140, 152, 164, 178, 190, 207, 221, 239]