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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 1
7 1
8 1
9 1
10 2
11 2
12 3
13 2
14 3
15 3
16 4
17 4
18 5
19 5
20 6
21 7
22 8
23 9
24 11
25 12
26 13
27 15
28 16
29 18
30 20
31 22
32 24
33 27
34 29
35 32
36 36
37 39
38 43
39 48
40 53
41 58
42 65
43 70
44 78
45 85
46 93
47 101
48 112
49 120
50 132
51 143
52 156
53 168
54 184
55 198
56 216
57 233
58 253
59 273
60 298
61 320
62 348
63 376
64 407
65 439

List of values

[0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 3, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 18, 20, 22, 24, 27, 29, 32, 36, 39, 43, 48, 53, 58, 65, 70, 78, 85, 93, 101, 112, 120, 132, 143, 156, 168, 184, 198, 216, 233, 253, 273, 298, 320, 348, 376, 407, 439]