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.

A239514 Number of partitions p of n such that if h = max(p) - min(p), then h is an (h,0)-separator of p; see Comments.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 0
8 2
9 2
10 3
11 2
12 4
13 2
14 7
15 6
16 7
17 6
18 10
19 7
20 14
21 12
22 18
23 12
24 22
25 18
26 23
27 23
28 31
29 29
30 42
31 33
32 45
33 42
34 54
35 49
36 68
37 62
38 78
39 76
40 95
41 87
42 110
43 102
44 124
45 128
46 150
47 141
48 178
49 174
50 203
51 203
52 237
53 228
54 272
55 269
56 308
57 318
58 360
59 356
60 422
61 420
62 472
63 482

List of values

[0, 0, 0, 0, 1, 1, 0, 2, 2, 3, 2, 4, 2, 7, 6, 7, 6, 10, 7, 14, 12, 18, 12, 22, 18, 23, 23, 31, 29, 42, 33, 45, 42, 54, 49, 68, 62, 78, 76, 95, 87, 110, 102, 124, 128, 150, 141, 178, 174, 203, 203, 237, 228, 272, 269, 308, 318, 360, 356, 422, 420, 472, 482]