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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 2
7 3
8 3
9 4
10 4
11 5
12 7
13 9
14 10
15 11
16 16
17 17
18 21
19 26
20 30
21 38
22 46
23 53
24 63
25 76
26 89
27 106
28 128
29 149
30 176
31 210
32 245
33 287
34 339
35 392
36 463
37 542
38 628
39 733
40 854
41 989
42 1150
43 1336
44 1542
45 1782
46 2063
47 2373
48 2736
49 3155
50 3620
51 4162
52 4783
53 5476
54 6275
55 7185
56 8210

List of values

[1, 1, 1, 2, 1, 2, 3, 3, 4, 4, 5, 7, 9, 10, 11, 16, 17, 21, 26, 30, 38, 46, 53, 63, 76, 89, 106, 128, 149, 176, 210, 245, 287, 339, 392, 463, 542, 628, 733, 854, 989, 1150, 1336, 1542, 1782, 2063, 2373, 2736, 3155, 3620, 4162, 4783, 5476, 6275, 7185, 8210]