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.

A239481 Number of partitions p of n such that if h = 2*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 0
5 1
6 0
7 0
8 1
9 0
10 2
11 2
12 1
13 2
14 3
15 4
16 5
17 7
18 6
19 9
20 13
21 13
22 17
23 22
24 25
25 32
26 39
27 43
28 55
29 67
30 78
31 93
32 113
33 132
34 158
35 191
36 217
37 260
38 308
39 357
40 424
41 498
42 576
43 676
44 792
45 916
46 1069
47 1244
48 1436
49 1666
50 1934
51 2225
52 2573
53 2971
54 3410
55 3932
56 4524
57 5183
58 5951
59 6826

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 2, 1, 2, 3, 4, 5, 7, 6, 9, 13, 13, 17, 22, 25, 32, 39, 43, 55, 67, 78, 93, 113, 132, 158, 191, 217, 260, 308, 357, 424, 498, 576, 676, 792, 916, 1069, 1244, 1436, 1666, 1934, 2225, 2573, 2971, 3410, 3932, 4524, 5183, 5951, 6826]