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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 4
9 5
10 7
11 11
12 13
13 18
14 24
15 30
16 37
17 48
18 59
19 73
20 90
21 109
22 132
23 163
24 193
25 233
26 280
27 334
28 397
29 475
30 559
31 663
32 784
33 924
34 1085
35 1279
36 1494
37 1751
38 2049
39 2392
40 2784
41 3248
42 3769
43 4382
44 5081
45 5887
46 6808
47 7879
48 9087
49 10486
50 12083
51 13910
52 15988
53 18384

List of values

[0, 0, 0, 0, 1, 1, 2, 4, 5, 7, 11, 13, 18, 24, 30, 37, 48, 59, 73, 90, 109, 132, 163, 193, 233, 280, 334, 397, 475, 559, 663, 784, 924, 1085, 1279, 1494, 1751, 2049, 2392, 2784, 3248, 3769, 4382, 5081, 5887, 6808, 7879, 9087, 10486, 12083, 13910, 15988, 18384]