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.

A239497 Number of partitions p of n such that if h = 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 1
5 2
6 3
7 4
8 5
9 7
10 9
11 11
12 15
13 17
14 22
15 28
16 34
17 40
18 52
19 60
20 75
21 90
22 109
23 129
24 160
25 186
26 225
27 268
28 321
29 376
30 455
31 530
32 632
33 743
34 878
35 1028
36 1219
37 1416
38 1667
39 1947
40 2281
41 2648
42 3103
43 3593
44 4189
45 4857
46 5638
47 6516
48 7564
49 8715
50 10080
51 11614
52 13394
53 15392

List of values

[0, 0, 1, 1, 2, 3, 4, 5, 7, 9, 11, 15, 17, 22, 28, 34, 40, 52, 60, 75, 90, 109, 129, 160, 186, 225, 268, 321, 376, 455, 530, 632, 743, 878, 1028, 1219, 1416, 1667, 1947, 2281, 2648, 3103, 3593, 4189, 4857, 5638, 6516, 7564, 8715, 10080, 11614, 13394, 15392]