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.

A239689 Number of partitions p of n such that if h = max(p) - min(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 1
5 0
6 0
7 1
8 1
9 0
10 2
11 0
12 1
13 3
14 2
15 1
16 4
17 0
18 4
19 5
20 5
21 4
22 5
23 5
24 7
25 7
26 10
27 6
28 15
29 10
30 13
31 13
32 14
33 16
34 20
35 18
36 26
37 24
38 29
39 28
40 34
41 27
42 39
43 40
44 47
45 46
46 57
47 55
48 65
49 63
50 75
51 72
52 83
53 85
54 101
55 101
56 117
57 115
58 136
59 134
60 157
61 156
62 170
63 181
64 200
65 197
66 229
67 230

List of values

[0, 0, 0, 1, 0, 0, 1, 1, 0, 2, 0, 1, 3, 2, 1, 4, 0, 4, 5, 5, 4, 5, 5, 7, 7, 10, 6, 15, 10, 13, 13, 14, 16, 20, 18, 26, 24, 29, 28, 34, 27, 39, 40, 47, 46, 57, 55, 65, 63, 75, 72, 83, 85, 101, 101, 117, 115, 136, 134, 157, 156, 170, 181, 200, 197, 229, 230]

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

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