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.

A239498 Number of partitions p of n such that if h = 2*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 3
10 1
11 2
12 5
13 4
14 4
15 8
16 7
17 9
18 15
19 15
20 18
21 23
22 26
23 32
24 43
25 47
26 57
27 72
28 80
29 98
30 120
31 138
32 163
33 198
34 227
35 267
36 323
37 372
38 438
39 517
40 596
41 696
42 818
43 944
44 1098
45 1282
46 1477
47 1711
48 1989
49 2285
50 2637
51 3049
52 3496
53 4023
54 4633
55 5303
56 6080
57 6976
58 7968

List of values

[0, 0, 1, 0, 0, 2, 0, 1, 3, 1, 2, 5, 4, 4, 8, 7, 9, 15, 15, 18, 23, 26, 32, 43, 47, 57, 72, 80, 98, 120, 138, 163, 198, 227, 267, 323, 372, 438, 517, 596, 696, 818, 944, 1098, 1282, 1477, 1711, 1989, 2285, 2637, 3049, 3496, 4023, 4633, 5303, 6080, 6976, 7968]