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.

A239501 Number of partitions p of n such that if h = max(p) - min(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 0
6 2
7 0
8 1
9 2
10 0
11 3
12 3
13 2
14 2
15 3
16 5
17 4
18 8
19 4
20 5
21 9
22 6
23 13
24 10
25 11
26 15
27 14
28 17
29 16
30 20
31 21
32 26
33 29
34 30
35 33
36 36
37 35
38 41
39 47
40 47
41 61
42 61
43 66
44 71
45 73
46 85
47 88
48 98
49 102
50 114
51 122
52 131
53 148
54 154
55 163
56 182
57 188
58 205
59 220
60 231
61 249
62 271
63 293
64 306
65 338
66 359

List of values

[0, 0, 1, 0, 0, 2, 0, 1, 2, 0, 3, 3, 2, 2, 3, 5, 4, 8, 4, 5, 9, 6, 13, 10, 11, 15, 14, 17, 16, 20, 21, 26, 29, 30, 33, 36, 35, 41, 47, 47, 61, 61, 66, 71, 73, 85, 88, 98, 102, 114, 122, 131, 148, 154, 163, 182, 188, 205, 220, 231, 249, 271, 293, 306, 338, 359]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.